Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization (1993)

by Farid Alizadeh
Venue:SIAM Journal on Optimization
Citations:499 - 12 self

Active Bibliography

43 A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with O (√n L)-iteration complexity – Florian A. Potra - 2006
9 A Potential Reduction Newton Method for Constrained Equations – R. D. C. Monteiro, Jong-Shi Pang - 1997
845 Semidefinite Programming – Lieven Vandenberghe, Stephen Boyd - 1996
121 Semidefinite optimization – M. J. Todd - 2001
27 Polynomial Convergence of a New Family of Primal-Dual Algorithms for Semidefinite Programming – Renato D. C. Monteiro , Takashi Tsuchiya - 1996
21 A Unified Analysis for a Class of Long-Step Primal-Dual Path-Following Interior-Point Algorithms for Semidefinite Programming – Renato D. C. Monteiro, Yin Zhang - 1998
4 Primal-Dual Affine-Scaling Algorithms Fail For Semidefinite Programming – Masakazu Muramatsu, Robert J. Vanderbei - 1998
5 Algorithms and Software for LMI Problems in Control – Lieven Vandenberghe, Venkataramanan Balakrishnan - 1997
unknown title – Renato D. C. Monteiro A, Yin Zhang B - 1997