Information geometry and interior-point algorithms in semidefinite programs and symmetric cone programs (Q364723): Difference between revisions

The authors consider interior-point algorithms for semi-definite programming and symmetric conic programming problems. They apply a differential geometric framework, the so-called information geometry, to these classes of problems and show relationships between complexity analysis and the curvature integral taken along the central path.