A New Notion of Weighted Centers for Semidefinite Programming

DOI10.1137/040613378zbMath1131.90038OpenAlexW2030400876MaRDI QIDQ5470234

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

semidefinite programmingCholesky decompositionfacial structureweighted centerhomogeneous cone programming

Mathematics Subject Classification ID

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

Related Items (5)

Invariance and efficiency of convex representations ⋮ Analyticity of weighted central paths and error bounds for semidefinite programming ⋮ An interior point method for solving semidefinite programs using cutting planes and weighted analytic centers ⋮ Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem ⋮ A relaxed logarithmic barrier method for semidefinite programming

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