Log-barrier interior point methods are not strongly polynomial - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles SIAM Journal on Applied Algebra and Geometry Year : 2018

Log-barrier interior point methods are not strongly polynomial

Abstract

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)$. The total curvature of the central path of these linear programs is also exponential in $r$, disproving a continuous analogue of the Hirsch conjecture proposed by Deza, Terlaky and Zinchenko. Our method is to tropicalize the central path in linear programming. The tropical central path is the piecewise-linear limit of the central paths of parameterized families of classical linear programs viewed through logarithmic glasses. This allows us to provide combinatorial lower bounds for the number of iterations and the total curvature, in a general setting.

Dates and versions

hal-01674959 , version 1 (03-01-2018)

Identifiers

Cite

Xavier Allamigeon, Pascal Benchimol, Stéphane Gaubert, Michael Joswig. Log-barrier interior point methods are not strongly polynomial. SIAM Journal on Applied Algebra and Geometry, 2018, 2 (1), pp.140-178. ⟨10.1137/17M1142132⟩. ⟨hal-01674959⟩
205 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More