Curvature integrals and iteration complexities in SDP and symmetric cone programs
From MaRDI portal
Publication:404518
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
Cites work
- scientific article; zbMATH DE number 715155 (Why is no real title available?)
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- scientific article; zbMATH DE number 1560711 (Why is no real title available?)
- scientific article; zbMATH DE number 4197739 (Why is no real title available?)
- 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
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
- Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals
- Extension of primal-dual interior point algorithms to symmetric cones
- Information Geometry and Interior-Point Algorithms
- Information geometry and interior-point algorithms in semidefinite programs and symmetric cone programs
- Interior path following primal-dual algorithms. I: Linear programming
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- On a commutative class of search directions for linear programming over symmetric cones
- On the Nesterov--Todd Direction in Semidefinite Programming
- On the complexity of following the central path of linear programs by linear extrapolation. II
- Polynomial Convergence of a New Family of Primal-Dual Algorithms for Semidefinite Programming
- SDPLIB 1.2, a library of semidefinite programming test problems
Cited in
(6)- 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
- A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix
- 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
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)
