Interior point methods are not worse than Simplex.
Xavier AllamigeonDaniel DadushGeorg LohoBento NaturaLászló A. VéghPublished in: FOCS (2022)
Keyphrases
- interior point methods
- linear programming
- simplex method
- simplex algorithm
- linear program
- primal dual
- convex optimization
- linear programming problems
- quadratic programming
- convex programming
- semidefinite programming
- interior point
- cutting plane method
- solving problems
- computationally intensive
- column generation
- feasible solution
- objective function
- semidefinite
- dynamic programming
- quadratically constrained quadratic
- machine learning
- total variation
- image restoration
- least squares
- np hard
- optimal solution
- training data