On a general class of interior-point algorithms for semidefinite programming with polynomial complexity and superlinear convergence

DOI10.4310/MAA.1999.v6.n4.a8zbMath0969.90066OpenAlexW2733198502MaRDI QIDQ1582351

Florian A. Potra, Jun Ji, Rongqin Sheng

Publication date: 14 January 2001

Published in: Methods and Applications of Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4310/maa.1999.v6.n4.a8

zbMATH Keywords

semidefinite programmingsuperlinear convergencepredictor-corrector algorithmsglobally convergentinfeasible-interior-point algorithm

Mathematics Subject Classification ID

Semidefinite programming (90C22) Interior-point methods (90C51)

Related Items (2)

A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization ⋮ Asymptotic behavior of underlying NT paths in interior point methods for monotone semidefinite linear complementarity problems

Uses Software

• SDPHA

This page was built for publication: On a general class of interior-point algorithms for semidefinite programming with polynomial complexity and superlinear convergence