Interior Point Trajectories in Semidefinite Programming
- 1 November 1998
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 8 (4), 871-886
- https://doi.org/10.1137/s105262349630009x
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite ProgrammingSIAM Journal on Optimization, 1998
- Primal-Dual Interior-Point Methods for Self-Scaled ConesSIAM Journal on Optimization, 1998
- Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite ProgrammingSIAM Journal on Optimization, 1998
- Primal--Dual Path-Following Algorithms for Semidefinite ProgrammingSIAM Journal on Optimization, 1997
- Strong Duality for Semidefinite ProgrammingSIAM Journal on Optimization, 1997
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric MatricesSIAM Journal on Optimization, 1997
- An Interior-Point Method for Semidefinite ProgrammingSIAM Journal on Optimization, 1996
- Semidefinite ProgrammingSIAM Review, 1996
- On a Matrix Generalization of Affine-Scaling Vector FieldsSIAM Journal on Matrix Analysis and Applications, 1995
- Cones of diagonally dominant matricesPacific Journal of Mathematics, 1975