Curvature integrals and iteration complexities in SDP and symmetric cone programs
DOI10.1007/S10589-013-9608-XzbMATH Open1319.90049OpenAlexW2161288103MaRDI QIDQ404518FDOQ404518
Authors: 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
Recommendations
- 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
- The curvature integral and the complexity of linear complementarity problems
- scientific article; zbMATH DE number 409894
- Information geometry and interior-point algorithms in semidefinite programs and symmetric cone programs
- A primal-dual predictor-corrector interior-point method for symmetric cone programming with \(O (\sqrt{r} \log \epsilon^{-1})\) iteration complexity
semidefinite programminginterior-point methodscurvatureprimal-dual algorithmsiteration complexitiessymmetric cone programspath-following methods
Cites Work
- SDPLIB 1.2, a library of semidefinite programming test problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- 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 strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms
- Information Geometry and Interior-Point Algorithms
- Interior path following primal-dual algorithms. I: Linear programming
- On a commutative class of search directions for linear programming over symmetric cones
- On the Nesterov--Todd Direction in Semidefinite Programming
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
- Information geometry and interior-point algorithms in semidefinite programs and symmetric cone programs
- Polynomial Convergence of a New Family of Primal-Dual Algorithms for Semidefinite Programming
Cited In (6)
- Doubly autoparallel structure and curvature integrals. Applications to iteration complexity for solving convex 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
- Two wide neighborhood interior-point methods for symmetric cone optimization
- A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix
- Information geometry and interior-point algorithms in semidefinite programs and symmetric cone programs
- Local convergence of primal-dual interior point methods for nonlinear semidefinite optimization using the Monteiro-Tsuchiya family of search directions
Uses Software
This page was built for publication: Curvature integrals and iteration complexities in SDP and symmetric cone programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q404518)
