On weighted centers for semidefinite programming

DOI10.1016/S0377-2217(99)00299-4zbMath0971.90058MaRDI QIDQ1584796

Jos F. Sturm, Shu-Zhong Zhang

Publication date: 5 November 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

existencesemidefinite programmingscale invariancecentral pathsymmetric primal-dual transformationprimal-dual mapsweighted centers

Mathematics Subject Classification ID

Semidefinite programming (90C22)

Related Items

On the use of coordinate-free matrix calculus, Analyticity of weighted central paths and error bounds for semidefinite programming, Implementation of interior point methods for mixed semidefinite and second order cone optimization problems, On the long-step path-following method for semidefinite programming, Analyticity of the central path at the boundary point in semidefinite programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• Symmetric primal-dual path-following algorithms for semidefinite programming
• Primal-dual target-following algorithms for linear programming
• On Two Interior-Point Mappings for Nonlinear Semidefinite Complementarity Problems
• Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
• Matrix Analysis
• On the Nesterov--Todd Direction in Semidefinite Programming
• Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• Semidefinite Programming