An O(r(cond(G))1/4log¼ϵ−1) iteration predictor–corrector interior-point method with a new one-norm neighbourhood for symmetric cone optimization

DOI10.1080/02331934.2021.1899177zbMath1506.90271OpenAlexW3137614794MaRDI QIDQ5045166

No author found.

Publication date: 4 November 2022

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2021.1899177

zbMATH Keywords

interior-point methodcomplexity boundEuclidean Jordan algebraone-normsymmetric cone optimization

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones
• A new primal-dual predictor-corrector interior-point method for linear programming based on a wide neighbourhood
• Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming
• Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
• An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming
• Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
• On finding a vertex solution using interior point methods
• Linear systems in Jordan algebras and primal-dual interior-point algorithms
• Extension of primal-dual interior point algorithms to symmetric cones
• A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization
• Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones
• A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization
• A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization
• Two wide neighborhood interior-point methods for symmetric cone optimization
• A New Iteration Large-Update Primal-Dual Interior-Point Method for Second-Order Cone Programming
• A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with $O(\sqrt{n}\log\frac{\mathrm{Tr}(X^0S^0)}{\epsilon})$ Iteration Complexity
• A primal–dual predictor–corrector interior-point method for symmetric cone programming with O(√r log ϵ⁻¹) iteration complexity
• A New Wide Neighborhood Primal-Dual Predictor-Corrector Interior-Point Method for Linear Programming
• On Mehrotra-Type Predictor-Corrector Algorithms
• On the Nesterov--Todd Direction in Semidefinite Programming
• Barrier Functions in Interior Point Methods
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• Interior Point Methods for Sufficient Horizontal LCP in a Wide Neighborhood of the Central Path with Best Known Iteration Complexity
• An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP

This page was built for publication: An O(r(cond(G))1/4log¼ϵ−1) iteration predictor–corrector interior-point method with a new one-norm neighbourhood for symmetric cone optimization