Faster Randomized Infeasible Interior Point Methods for Tall/Wide Linear Programs.
Agniva ChowdhuryPalma LondonHaim AvronPetros DrineasPublished in: NeurIPS (2020)
Keyphrases
- linear program
- interior point methods
- linear programming
- primal dual
- convex programming
- interior point
- semi infinite
- simplex method
- linear programming problems
- optimal solution
- extreme points
- mixed integer
- objective function
- dynamic programming
- semidefinite programming
- integer program
- column generation
- semidefinite
- simplex algorithm
- search space
- lp relaxation
- convex optimization
- np hard
- quadratic programming