Keywords
Semidefinite programmingMathematicsParametric statisticsSemidefinite embeddingMathematical optimizationLinear programmingBellman equationParametric programmingApplied mathematicsRange (aeronautics)Quadratically constrained quadratic programStatistics
Affiliated Institutions
Related Publications
A Direct Formulation for Sparse PCA Using Semidefinite Programming
Given a covariance matrix, we consider the problem of maximizing the variance explained by a particular linear combination of the input variables while constraining the number o...
A new approach to variable metric algorithms
An approach to variable metric algorithms has been investigated in which the linear search sub-problem no longer becomes necessary. The property of quadratic termination has bee...
A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
An exact-penalty-function-based scheme---inspired from an old idea due to Mayne and Polak [Math. Program., 11 (1976), pp.67--80]---is proposed for extending to general smooth co...
Interior-Point Polynomial Algorithms in Convex Programming
Written for specialists working in optimization, mathematical programming, or control theory. The general theory of path-following and potential reduction interior point polynom...
Interior Methods for Nonlinear Optimization
Interior methods are an omnipresent, conspicuous feature of the constrained optimization landscape today, but it was not always so. Primarily in the form of barrier methods, int...
Publication Info
- Year
- 1999
- Type
- article
- Volume
- 29
- Issue
- 3
- Pages
- 361-377
- Citations
- 37
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
37
OpenAlex
Cite This
Donald Goldfarb,
Katya Scheinberg
(1999).
On parametric semidefinite programming.
Applied Numerical Mathematics
, 29
(3)
, 361-377.
https://doi.org/10.1016/s0168-9274(98)00102-0
Identifiers
- DOI
- 10.1016/s0168-9274(98)00102-0