Information geometry and interior-point algorithms in semidefinite programs and symmetric cone programs

DOI10.1007/s10957-012-0180-9zbMath1322.90112OpenAlexW2060681267MaRDI QIDQ364723

Takashi Tsuchiya, Atsumi Ohara, Satoshi Kakihara

Publication date: 9 September 2013

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-012-0180-9

zbMATH Keywords

interior-point methodsinformation geometrysemidefinite programsconic programmingcurvature integraliteration complexitiessymmetric cone programs

Mathematics Subject Classification ID

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

Related Items

Log-Barrier Interior Point Methods Are Not Strongly Polynomial, Matrix monotonicity and self-concordance: how to handle quantum entropy in optimization problems, Curvature integrals and iteration complexities in SDP and symmetric cone programs, Doubly autoparallel structure and curvature integrals. Applications to iteration complexity for solving convex programs, The face lattice of the set of reduced density matrices and its coatoms, What Tropical Geometry Tells Us about the Complexity of Linear Programming, A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Curvature integrals and iteration complexities in SDP and symmetric cone programs
• A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms
• On the complexity of following the central path of linear programs by linear extrapolation. II
• Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals
• A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
• A primal-dual interior point method whose running time depends only on the constraint matrix
• Linear systems in Jordan algebras and primal-dual interior-point algorithms
• Extension of primal-dual interior point algorithms to symmetric cones
• On a commutative class of search directions for linear programming over symmetric cones
• Dualistic differential geometry of positive definite matrices and its applications to related problems