Log In Sign Up

No self-concordant barrier interior point method is strongly polynomial

by   Xavier Allamigeon, et al.

It is an open question to determine if the theory of self-concordant barriers can provide an interior point method with strongly polynomial complexity in linear programming. In the special case of the logarithmic barrier, it was shown in [Allamigeon, Benchimol, Gaubert and Joswig, SIAM J. on Applied Algebra and Geometry, 2018] that the answer is negative. In this paper, we show that none of the self-concordant barrier interior point methods is strongly polynomial. This result is obtained by establishing that, on parametric families of convex optimization problems, the log-limit of the central path degenerates to a piecewise linear curve, independently of the choice of the barrier function. We provide an explicit linear program that falls in the same class as the Klee-Minty counterexample, i.e., in dimension n with 2n constraints, in which the number of iterations is Ω(2^n).


page 1

page 2

page 3

page 4


The entropic barrier is n-self-concordant

For any convex body K ⊆ℝ^n, S. Bubeck and R. Eldan introduced the entrop...

First passage time for Slepian process with linear barrier

In this paper we extend results of L.A. Shepp by finding explicit formul...

A polynomial time log barrier method for problems with nonconvex constraints

Interior point methods (IPMs) that handle nonconvex constraints such as ...

Interior point methods are not worse than Simplex

Whereas interior point methods provide polynomial-time linear programmin...

Generalized Self-concordant Hessian-barrier algorithms

Many problems in statistical learning, imaging, and computer vision invo...

Strong Self-Concordance and Sampling

Motivated by the Dikin walk, we develop aspects of an interior-point the...

Semiparametric Estimation of Optimal Dividend Barrier for Spectrally Negative Lévy Process

We disucss a statistical estimation problem of an optimal dividend barri...