A New Notion of Weighted Centers for Semidefinite Programming

DOI10.1137/040613378MaRDI QIDQ5470234zbMATH OpenOpenAlexFDO

Authors Chek Beng Chua

Publication date 30 May 2006

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://hdl.handle.net/10356/100091

zbMATH Keywords

Cholesky decompositionfacial structurehomogeneous cone programmingsemidefinite programmingweighted center

Mathematics Subject Classification ID

Semidefinite programming (90C22) Convex programming (90C25) Interior-point methods (90C51)

Recommendations

• On weighted centers for semidefinite programming
• Analyticity of weighted central paths and error bounds for semidefinite programming
• A weighted analytic center for linear matrix inequalities
• Error Bounds and Limiting Behavior of Weighted Paths Associated with the SDP Map X1/2SX1/2
• Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming

Cited in

(9)

• On weighted centers for semidefinite programming
• An interior point method for solving semidefinite programs using cutting planes and weighted analytic centers
• Invariance and efficiency of convex representations
• A weighted analytic center for linear matrix inequalities
• Solving LP Problems via Weighted Centers
• A relaxed logarithmic barrier method for semidefinite programming
• Sufficient weighted second-order cone complementarity problems
• Analyticity of weighted central paths and error bounds for semidefinite programming
• Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem

This page was built for publication: A New Notion of Weighted Centers for Semidefinite Programming

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