How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds.
Antoine DezaEissa NematollahiTamás TerlakyPublished in: Math. Program. (2008)
Keyphrases
- simplex method
- interior point methods
- complexity bounds
- linear program
- linear programming
- primal dual
- convex optimization
- worst case
- semidefinite programming
- objective function
- quadratic programming
- constraint networks
- computationally intensive
- column generation
- query containment
- np hard
- branch and bound
- convergence rate
- optimal solution
- linear systems
- transitive closure
- dynamic programming
- image processing