A New Second-Order Infeasible Primal-Dual Path-Following Algorithm for Symmetric Optimization
From MaRDI portal
Publication:3188450
DOI10.1080/01630563.2016.1138127zbMath1346.90581OpenAlexW2341941304MaRDI QIDQ3188450
Ximei Yang, Yinkui Zhang, Pei-Ping Shen, Hong-Wei Liu
Publication date: 19 August 2016
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630563.2016.1138127
path-following algorithmEuclidean Jordan algebrasymmetric cone optimizationinfeasiblesecond-order corrector
Related Items
A primal–dual predictor–corrector interior-point method for symmetric cone programming with O(√r log ϵ−1) iteration complexity ⋮ A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization
Cites Work
- Unnamed Item
- A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
- Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization
- 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
- A new polynomial-time algorithm for linear programming
- Polynomial time second order mehrotra-type predictor--corrector algorithms
- A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- On the rate of local convergence of high-order-infeasible-path-following algorithms for \(P_*\)-linear complementarity problems
- On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- On the Implementation of a Primal-Dual Interior Point Method
- 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
- High-order predictor-corrector algorithms
- An Asymptotical $O(\sqrt{n} L)$-Iteration Path-Following Linear Programming Algorithm That Uses Wide Neighborhoods
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
- High order long-step methods for solving linear complementarity problems
This page was built for publication: A New Second-Order Infeasible Primal-Dual Path-Following Algorithm for Symmetric Optimization
