On the worst case complexity of potential reduction algorithms for linear programming

zbMath0891.90127MaRDI QIDQ1373761

Dimitris J. Bertsimas, Xiao-Dong Luo

Publication date: 3 August 1998

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

zbMATH Keywords

interior point algorithmslower bounds on complexitypotential reduction algorithms

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05)

Related Items

Log-Barrier Interior Point Methods Are Not Strongly Polynomial