A primal–dual predictor–corrector interior-point method for symmetric cone programming with O(√r log ϵ−1) iteration complexity

DOI10.1080/00207160.2016.1274742zbMath1391.90409OpenAlexW2567093390MaRDI QIDQ3174878

No author found.

Publication date: 18 July 2018

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

interior-point methodspredictor-corrector algorithmsymmetric coneEuclidean Jordan algebrawide neighbourhood

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51)

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization
• A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
• 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
• Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
• A new primal-dual path-following interior-point algorithm for semidefinite optimization
• Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
• Linear systems in Jordan algebras and primal-dual interior-point algorithms
• Euclidean Jordan algebras and interior-point algorithms
• Extension of primal-dual interior point algorithms to symmetric cones
• Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones
• A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
• Neighborhood-following algorithms for linear programming
• A wide neighbourhood interior-point method with iteration-complexity bound for semidefinite 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 New Second-Order Infeasible Primal-Dual Path-Following Algorithm for Symmetric Optimization
• On Mehrotra-Type Predictor-Corrector Algorithms
• On the Implementation of a Primal-Dual Interior Point Method
• On the Nesterov--Todd Direction in Semidefinite Programming
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear 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
• An iteration primal–dual path-following method, based on wide neighbourhood and large update, for second-order cone programming
• SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps
• An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
• A Jordan-algebraic approach to potential-reduction algorithms