Semidefinite Programming: A Path-Following Algorithm for a Linear–Quadratic Functional
- 1 November 1996
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 6 (4) , 1007-1024
- https://doi.org/10.1137/s1052623494270741
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical ResultsSIAM Journal on Optimization, 1998
- Barrier Functions in Interior Point MethodsMathematics of Operations Research, 1996
- On a Matrix Generalization of Affine-Scaling Vector FieldsSIAM Journal on Matrix Analysis and Applications, 1995
- Linear Matrix Inequalities in System and Control TheoryPublished by Society for Industrial & Applied Mathematics (SIAM) ,1994
- Interior-Point Polynomial Algorithms in Convex ProgrammingPublished by Society for Industrial & Applied Mathematics (SIAM) ,1994
- Optimization and Dynamical SystemsPublished by Springer Nature ,1994
- Interior Point Approach to Linear, Quadratic and Convex ProgrammingPublished by Springer Nature ,1994
- An Interior-Point Method for Minimizing the Maximum Eigenvalue of a Linear Combination of MatricesSIAM Journal on Control and Optimization, 1993
- Method of centers for minimizing generalized eigenvaluesLinear Algebra and its Applications, 1993
- Path-Following Methods for Linear ProgrammingSIAM Review, 1992