How good are interior point methods? Klee–Minty cubes tighten iteration-complexity bounds
- 21 October 2006
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 113 (1) , 1-14
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The central path visits all the vertices of the Klee–Minty cubeOptimization Methods and Software, 2006
- An "analytical centre" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming2006
- Interior Point Algorithms1997
- Primal-Dual Interior-Point Methods1997
- A lower bound on the number of iterations of long-step primal-dual linear programming algorithmsAnnals of Operations Research, 1996
- Pivot rules for linear programming: A survey on recent theoretical developmentsAnnals of Operations Research, 1993
- Boundary Behavior of Interior Point Algorithms in Linear ProgrammingMathematics of Operations Research, 1989
- Pathways to the Optimal Set in Linear Programming1989
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984