Interior point methods are not worse than Simplex.
Xavier AllamigeonDaniel DadushGeorg LohoBento NaturaLászló A. VéghPublished in: CoRR (2022)
Keyphrases
- interior point methods
- linear programming
- simplex method
- simplex algorithm
- primal dual
- linear program
- convex optimization
- linear programming problems
- convex programming
- semidefinite programming
- interior point
- quadratic programming
- computationally intensive
- solving problems
- quadratically constrained quadratic
- semidefinite
- np hard
- cutting plane method
- column generation
- singular value decomposition
- dynamic programming
- objective function