On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming
From MaRDI portal
Publication:4943613
DOI10.1137/S1052623497316828zbMath0959.65076OpenAlexW2056571280MaRDI QIDQ4943613
Florian A. Potra, Rongqin Sheng, Jun Ji
Publication date: 19 March 2000
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623497316828
semidefinite programmingquadratic convergenceinterior point methodlocal convergencesuperlinear convergencepredictor-corrector algorithmstep-size selection
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Convex programming (90C25) Interior-point methods (90C51)
Related Items (19)
Polynomial convergence of Mehrotra-type prediction-corrector infeasible-IPM for symmetric optimization based on the commutative class directions ⋮ Local Superlinear Convergence of Polynomial-Time Interior-Point Methods for Hyperbolicity Cone Optimization Problems ⋮ Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems ⋮ A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization ⋮ Strong duality and minimal representations for cone optimization ⋮ A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization ⋮ Asymptotic behavior of underlying NT paths in interior point methods for monotone semidefinite linear complementarity problems ⋮ Logarithmic barrier method via minorant function for linear semidefinite programming ⋮ Generating and measuring instances of hard semidefinite programs ⋮ Unnamed Item ⋮ A polynomial time constraint-reduced algorithm for semidefinite optimization problems ⋮ Analyticity of weighted central paths and error bounds for semidefinite programming ⋮ An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming ⋮ A Mehrotra type predictor-corrector interior-point algorithm for linear programming ⋮ Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions ⋮ Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP ⋮ A relaxed logarithmic barrier method for semidefinite programming ⋮ Study of a Logarithmic Barrier Approach for Linear Semidefinite Programming ⋮ Interior-point methods
This page was built for publication: On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming
