Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming

DOI10.1007/s00186-010-0334-1zbMath1229.90084OpenAlexW1979759774MaRDI QIDQ627455

Jian Zhang, Ke-Cun Zhang

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

zbMATH Keywords

interior point methodEuclidean Jordan algebrasymetric cone

Mathematics Subject Classification ID

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

Related Items (23)

Infeasible Mehrotra-type predictor–corrector algorithm for cartesian P_*(κ) nonlinear complementarity problems over symmetric cones ⋮ On the central paths in symmetric cone programming ⋮ An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path ⋮ An O(r(cond(G))1/4log¼ϵ−1) iteration predictor–corrector interior-point method with a new one-norm neighbourhood for symmetric cone optimization ⋮ A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones ⋮ A primal–dual predictor–corrector interior-point method for symmetric cone programming with O(√r log ϵ⁻¹) iteration complexity ⋮ A wide neighbourhood predictor–corrector infeasible-interior-point algorithm for symmetric cone programming ⋮ Polynomial convergence of Mehrotra-type prediction-corrector infeasible-IPM for symmetric optimization based on the commutative class directions ⋮ A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization ⋮ A New Second-Order Infeasible Primal-Dual Path-Following Algorithm for Symmetric Optimization ⋮ Two wide neighborhood interior-point methods for symmetric cone optimization ⋮ A new infeasible-interior-point algorithm for linear programming over symmetric cones ⋮ A new wide neighborhood primal-dual infeasible-interior-point method 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 second-order mehrotra-type predictor-corrector algorithms over symmetric cones ⋮ An arc search infeasible interior-point algorithm for symmetric optimization using a new wide neighborhood ⋮ A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization ⋮ A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming ⋮ A wide neighborhood infeasible-interior-point method with arc-search for -SCLCPs ⋮ A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization ⋮ A polynomial-iteration infeasible interior-point algorithm with arc-search for semidefinite optimization ⋮ A predictor-corrector infeasible-interior-point method for the Cartesian -LCP over symmetric cones with iteration complexity ⋮ Infeasible path-following interior point algorithm for Cartesian P_*(κ) nonlinear complementarity problems over symmetric cones

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

This page was built for publication: Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming