Interior-Point Methods Strike Back: Solving the Wasserstein Barycenter Problem.
Dongdong GeHaoyue WangZikai XiongYinyu YePublished in: NeurIPS (2019)
Keyphrases
- interior point methods
- quadratic programming
- linear programming problems
- convex programming
- convex optimization
- linear programming
- solving problems
- simplex method
- primal dual
- semidefinite programming
- linear program
- interior point
- cutting plane method
- computationally intensive
- semidefinite
- np hard
- quadratic program
- dynamic programming
- lower bound
- quadratically constrained quadratic