Curvature integrals and iteration complexities in SDP and symmetric cone programs

DOI10.1007/s10589-013-9608-xzbMath1319.90049OpenAlexW2161288103MaRDI QIDQ404518

Atsumi Ohara, Satoshi Kakihara, Takashi Tsuchiya

Publication date: 4 September 2014

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

Full work available at URL: https://doi.org/10.1007/s10589-013-9608-x

zbMATH Keywords

semidefinite programmingcurvatureinterior-point methodsprimal-dual algorithmsiteration complexitiessymmetric cone programspath-following methods

Mathematics Subject Classification ID

Semidefinite programming (90C22)

Related Items

Two wide neighborhood interior-point methods for symmetric cone optimization, Information geometry and interior-point algorithms in semidefinite programs and symmetric cone programs, Doubly autoparallel structure and curvature integrals. Applications to iteration complexity for solving convex programs, A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix

Uses Software

• SDPLIB
• Netlib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Information geometry and interior-point algorithms in semidefinite programs 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
• Interior path following primal-dual algorithms. I: Linear programming
• 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
• 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
• On the Nesterov--Todd Direction in Semidefinite Programming
• SDPLIB 1.2, a library of semidefinite programming test problems
• Polynomial Convergence of a New Family of Primal-Dual Algorithms for Semidefinite Programming
• Information Geometry and Interior-Point Algorithms