A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones
From MaRDI portal
Publication:306357
DOI10.1007/s11075-015-0074-7zbMath1346.90580OpenAlexW2192251088MaRDI QIDQ306357
Ximei Yang, Yinkui Zhang, Yong Gang Pei, Hong-Wei Liu
Publication date: 31 August 2016
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-015-0074-7
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, An inexact non-interior continuation method for semidefinite programming: convergence analysis and numerical results, A wide neighbourhood predictor–corrector infeasible-interior-point algorithm for symmetric cone programming, A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy, Polynomial convergence of primal-dual path-following algorithms for symmetric cone programming based on wide neighborhoods and a new class of directions, Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones, A corrector-predictor arc search interior-point algorithm for symmetric optimization, A New Predictor-corrector Infeasible Interior-point Algorithm for Linear Optimization in aWide Neighborhood
Uses Software
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
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- A primal-dual infeasible-interior-point algorithm for linear programming
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
- Extension of primal-dual interior point algorithms to symmetric cones
- On a commutative class of search directions for linear programming over symmetric cones
- On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
- 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 quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
- Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones
- 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
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- Barrier Functions in Interior Point Methods
- SDPLIB 1.2, a library of semidefinite programming test problems
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
