Polynomial primal-dual affine scaling algorithms in semidefinite programming
From MaRDI portal
Publication:1386485
DOI10.1023/A:1009791827917zbMath0911.90252OpenAlexW1562269582MaRDI QIDQ1386485
Etienne de Klerk, Cornelis Roos, Tamás Terlaky
Publication date: 5 May 1999
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1009791827917
semidefinite programminginterior-point methodprimal-dual methodDikin stepsprimal-dual affine scaling algorithmsworst-case complexity bound
Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05)
Related Items (4)
A polynomial primal-dual affine scaling algorithm for symmetric conic optimization ⋮ Large-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation ⋮ Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions ⋮ Symmetric primal-dual path-following algorithms for semidefinite programming
This page was built for publication: Polynomial primal-dual affine scaling algorithms in semidefinite programming