On the long-step path-following method for semidefinite programming

DOI10.1016/S0167-6377(98)00014-5zbMath0911.90257MaRDI QIDQ1273093

Jos F. Sturm, Shu-Zhong Zhang

Publication date: 6 December 1998

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

semidefinite programminglong-step path-followingshort-step primal-dual path following algorithmssymmetric primal-dual transformation

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05)

Related Items (4)

On a special class of regularized central paths for semidefinite programs ⋮ A long-step primal--dual algorithm for the symmetric programming problem ⋮ Smaller SDP for SOS decomposition ⋮ A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming

Cites Work

• Unnamed Item
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• Symmetric primal-dual path-following algorithms for semidefinite programming
• On weighted centers for semidefinite programming
• Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• Primal--Dual Path-Following Algorithms for Semidefinite Programming
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• A note on the Nesterov-Todd and the Kojima-Shindoh-hara search directions in semidefinite programming
• A Predictor-Corrector Interior-Point Algorithm for the Semidefinite Linear Complementarity Problem Using the Alizadeh--Haeberly--Overton Search Direction
• An Interior-Point Method for Semidefinite Programming

This page was built for publication: On the long-step path-following method for semidefinite programming