Exploiting sparsity in primal-dual interior-point methods for semidefinite programming
- 1 October 1997
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 79 (1) , 235-253
- https://doi.org/10.1007/bf02614319
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical ResultsSIAM Journal on Optimization, 1998
- 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
- Local convergence of predictor—corrector infeasible-interior-point algorithms for SDPs and SDLCPsMathematical Programming, 1998
- Primal--Dual Path-Following Algorithms 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
- A recipe for semidefinite relaxation for (0,1)-quadratic programmingJournal of Global Optimization, 1995
- Linear Matrix Inequalities in System and Control TheoryPublished by Society for Industrial & Applied Mathematics (SIAM) ,1994