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.

This paper supersedes arXiv:1405.4161. 31 pages, 5 figures, 1 table

References in corpus (2)

• Duality and separation theorems in idempotent semimodules
• A Field of Generalised Puiseux Series for Tropical Geometry

Cited by in corpus (17)

• Tropical medians by transportation
• Parametric shortest-path algorithms via tropical geometry
• Approximating the Volume of Tropical Polytopes is Difficult
• Tropical bisectors and Voronoi diagrams
• The tropical analogue of the Helton-Nie conjecture is true
• Tropical Gaussians: A Brief Survey
• An Invitation to Tropical Alexandrov Curvature
• Detecting tropical defects of polynomial equations
• A Nearly-Linear Time Algorithm for Linear Programs with Small Treewidth: A Multiscale Representation of Robust Central Path
• Asymmetric tropical distances and power diagrams
• Face posets of tropical polyhedra and monomial ideals
• The degree of the central curve in semidefinite, linear, and quadratic programming
• The complexity of geometric scaling
• Convergent Hahn Series and Tropical Geometry of Higher Rank
• Oriented Matroids from Triangulations of Products of Simplices
• The tropicalization of the entropic barrier
• Formalizing the Face Lattice of Polyhedra