No self-concordant barrier interior point method is strongly polynomial.
Xavier AllamigeonStéphane GaubertNicolas VandamePublished in: CoRR (2022)
Keyphrases
- strongly polynomial
- interior point methods
- linear programming
- linear program
- primal dual
- semidefinite programming
- interior point algorithm
- quadratic programming
- objective function
- inequality constraints
- np hard
- optimal solution
- dynamic programming
- coefficient matrix
- minimum cost flow
- convex optimization
- feasible solution
- solving problems
- machine learning
- knapsack problem
- dynamical systems
- image processing