Login / Signup
Log-Barrier Interior Point Methods Are Not Strongly Polynomial.
Xavier Allamigeon
Pascal Benchimol
Stéphane Gaubert
Michael Joswig
Published in:
SIAM J. Appl. Algebra Geom. (2018)
Keyphrases
</>
interior point methods
strongly polynomial
linear programming
linear program
primal dual
interior point
semidefinite programming
quadratic programming
np hard
minimum cost flow
convex optimization
optimal solution
dynamic programming
semidefinite
feasible solution
objective function
learning algorithm
lower bound