Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming
From MaRDI portal
Publication:627455
DOI10.1007/s00186-010-0334-1zbMath1229.90084MaRDI QIDQ627455
Publication date: 2 March 2011
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-010-0334-1
Cites Work
- Unnamed Item
- Unnamed Item
- Polynomial time second order mehrotra-type predictor--corrector algorithms
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions
- On a commutative class of search directions for linear programming over symmetric cones
- On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
- Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones
- On the Implementation of a Primal-Dual Interior Point Method
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Polynomial Convergence of Primal-Dual Algorithms for Semidefinite Programming Based on the Monteiro and Zhang Family of Directions
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
