1 code implementation • 4 Aug 2017 • Xavier Allamigeon, Pascal Benchimol, Stéphane Gaubert, Michael Joswig
We prove that primal-dual log-barrier interior point methods are not strongly polynomial, by constructing a family of linear programs with $3r+1$ inequalities in dimension $2r$ for which the number of iterations performed is in $\Omega(2^r)$.
Optimization and Control Combinatorics 90C51, 14T05
