Superlinear convergence of interior-point algorithms for semidefinite programming

DOI10.1023/A:1021700210959zbMath0911.90255OpenAlexW1487405513MaRDI QIDQ1273164

Florian A. Potra, Rongqin Sheng

Publication date: 5 May 1999

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1021700210959

zbMATH Keywords

semidefinite programmingsuperlinear convergencecentral pathpolynomialityprimal-dual infeasible interior-point path-following algorithm

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (17)

A constraint-reduced algorithm for semidefinite optimization problems with superlinear convergence ⋮ Local Superlinear Convergence of Polynomial-Time Interior-Point Methods for Hyperbolicity Cone Optimization Problems ⋮ Initialization in semidefinite programming via a self-dual skew-symmetric embedding ⋮ Exploiting sparsity in primal-dual interior-point methods for semidefinite programming ⋮ Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems ⋮ Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs ⋮ A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming ⋮ Asymptotic behavior of underlying NT paths in interior point methods for monotone semidefinite linear complementarity problems ⋮ Local and superlinear convergence of a primal-dual interior point method for nonlinear semidefinite programming ⋮ A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming ⋮ A polynomial time constraint-reduced algorithm for semidefinite optimization problems ⋮ An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming ⋮ Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence ⋮ Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming ⋮ Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem ⋮ Polynomial primal-dual cone affine scaling for semidefinite programming ⋮ Interior-point methods

Cites Work

• Unnamed Item
• Symmetric primal-dual path-following algorithms for semidefinite programming
• Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
• Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
• A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• On homogeneous interrior-point algorithms for semidefinite programming
• A Predictor-Corrector Interior-Point Algorithm for the Semidefinite Linear Complementarity Problem Using the Alizadeh--Haeberly--Overton Search Direction
• Semidefinite Programming
• An Interior-Point Method for Semidefinite Programming

This page was built for publication: Superlinear convergence of interior-point algorithms for semidefinite programming