Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming

DOI10.1007/s10107-003-0431-5zbMath1098.90051OpenAlexW2080605902MaRDI QIDQ1434073

Kim-Chuan Toh, Guanglu Zhou

Publication date: 1 July 2004

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-003-0431-5

zbMATH Keywords

semidefinite programmingpolynomial complexityprimal-dualinexact search directioninfeasible interior point method

Mathematics Subject Classification ID

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

Related Items

An inexact non-interior continuation method for semidefinite programming: convergence analysis and numerical results, A wide neighbourhood predictor–corrector infeasible-interior-point algorithm for symmetric cone programming, Two wide neighborhood interior-point methods for symmetric cone optimization, A New Stopping Criterion for Krylov Solvers Applied in Interior Point Methods, An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection, A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization, An inexact primal-dual path following algorithm for convex quadratic SDP, Convergence analysis of the inexact infeasible interior-point method for linear optimization, An interior point-proximal method of multipliers for linear positive semi-definite programming