On weighted centers for semidefinite programming

DOI10.1016/S0377-2217(99)00299-4MaRDI QIDQ1584796zbMATH OpenFDO

Authors Jos F. Sturm, Shuzhong Zhang

Publication date 5 November 2000

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

zbMATH Keywords

semidefinite programmingexistencescale invariancecentral pathsymmetric primal-dual transformationprimal-dual mapsweighted centers

Mathematics Subject Classification ID

Semidefinite programming (90C22)

Recommendations

• A New Notion of Weighted Centers for Semidefinite Programming
• Solving LP Problems via Weighted Centers
• A Polynomial Method of Weighted Centers for Convex Quadratic Programming
• Method of approximate centers for semi-definite programming
• Analyticity of weighted central paths and error bounds for semidefinite programming
• On weighted rectilinear 2-center and 3-center problems
• Interior-point algorithms for a generalization of linear programming and weighted centring
• Limiting behaviour and analyticity of weighted central paths in semidefinite programming
• On the central path for nonlinear semidefinite programming
• On sensitivity of central solutions in semidefinite programming

Cites work

• scientific article; zbMATH DE number 4164543 (Why is no real title available?)
• scientific article; zbMATH DE number 4067100 (Why is no real title available?)
• scientific article; zbMATH DE number 4126998 (Why is no real title available?)
• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
• Matrix Analysis
• On the Nesterov--Todd Direction in Semidefinite Programming
• On two interior-point mappings for nonlinear semidefinite complementarity problems
• Primal-dual target-following algorithms for linear programming
• Semidefinite Programming
• Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming
• Symmetric primal-dual path-following algorithms for semidefinite programming

Cited in

(10)

• On the long-step path-following method for semidefinite programming
• Method of approximate centers for semi-definite programming
• Solving LP Problems via Weighted Centers
• Weighted central path in semidefinite programming associated with symmetrization map\newline \((XS+SX)/2\)
• 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
• A weighted analytic center for linear matrix inequalities
• Analyticity of the central path at the boundary point in semidefinite programming
• On the use of coordinate-free matrix calculus
• A New Notion of Weighted Centers for Semidefinite Programming

This page was built for publication: On weighted centers for semidefinite programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584796)