The Iteration-Complexity Upper Bound for the Mizuno-Todd-Ye Predictor-Corrector Algorithm is Tight

  • Murat MutEmail author
  • Tamás Terlaky
Conference paper
Part of the Springer Proceedings in Mathematics & Statistics book series (PROMS, volume 279)


It is an open question whether there is an interior-point algorithm for linear optimization problems with a lower iteration-complexity than the classical bound \(\mathcal {O}(\sqrt{n} \log (\frac{\mu _1}{\mu _0}))\). This paper provides a negative answer to that question for a variant of the Mizuno-Todd-Ye predictor-corrector algorithm. In fact, we prove that for any \(\varepsilon >0\), there is a redundant Klee-Minty cube for which the aforementioned algorithm requires \(n^{( \frac{1}{2}-\varepsilon )} \) iterations to reduce the barrier parameter by at least a constant. This is provably the first case of an adaptive step interior-point algorithm where the classical iteration-complexity upper bound is shown to be tight.


Curvature Central path Polytopes Complexity Interior-point methods Linear optimization 

Mathematics Subject Classification (2000)

65K05 68Q25 90C05 90C51 90C60 



Research supported by a Start-up grant of Lehigh University. It is also supported by TAMOP-4.2.2.A-11/1KONV-2012-0012: Basic research for the development of hybrid and electric vehicles. The TAMOP Project is supported by the European Union and co-financed by the European Regional Development Fund.


  1. 1.
    Deza, A., Nematollahi, E., Peyghami, R., Terlaky, T.: The central path visits all the vertices of the Klee-Minty cube. Optim. Methods Softw. 21(5), 851–865 (2006)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Deza, A., Nematollahi, E., Terlaky, T.: How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds. Math. Program. 113(1), 1–14 (2008)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Huhn, P., Borgwardt, K.H.: Interior-point methods: worst case and average case analysis of a phase-i algorithm and a termination procedure. J. Complex. 18(3), 833–910 (2002)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Jansen, B., Roos, C., Terlaky, T.: A short survey on ten years interior point methods. Technical report 95–45, Delft University of Technology, Delft, The Netherlands (1995)Google Scholar
  5. 5.
    Karmarkar, N.: A new polynomial-time algorithm for linear programming. Combinatorica 4(4), 373–395 (1984)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Megiddo, N., Shub, M.: Boundary behavior of interior point algorithms in linear programming. Math. Oper. Res. 14(1), 97–146 (1989)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Mizuno, S., Todd, M., Ye, Y.: Anticipated behavior of path-following algorithms for linear programming. Technical report 878, School of Operations Research and Industrial Engineering, Ithaca, New York (1989)Google Scholar
  8. 8.
    Mizuno, S., Todd, M.J., Ye, Y.: On adaptive-step primal-dual interior-point algorithms for linear programming. Math. Oper. Res. 18(4), 964–981 (1993)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Mut, M., Terlaky, T.: An analogue of the Klee-Walkup result for Sonnevend’s curvature of the central path. J. Optim. Theory Appl. 169(1), 17–31 (2016)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Nematollahi, E., Terlaky, T.: A redundant Klee-Minty construction with all the redundant constraints touching the feasible region. Oper. Res. Lett. 36(4), 414–418 (2008)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Nematollahi, E., Terlaky, T.: A simpler and tighter redundant Klee-Minty construction. Optim. Lett. 2(3), 403–414 (2008)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Nesterov, Y., Nemirovskii, A.: Interior-Point Polynomial Algorithms in Convex Programming, vol. 13. SIAM, Philadelphia (1994)CrossRefGoogle Scholar
  13. 13.
    Potra, F.A.: A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points. Math. Program. 67(1–3), 383–406 (1994)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Roos, C., Terlaky, T., Vial, J.P.: Interior Point Methods for Linear Optimization. Springer, New York (2006)zbMATHGoogle Scholar
  15. 15.
    Sonnevend, G., Stoer, J., Zhao, G.: On the complexity of following the central path of linear programs by linear extrapolation II. Math. Program. 52, 527–553 (1991)MathSciNetCrossRefGoogle Scholar
  16. 16.
    Stoer, J., Zhao, G.: Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals. Appl. Math. Optim. 27, 85–103 (1993)MathSciNetCrossRefGoogle Scholar
  17. 17.
    Todd, M.J.: A lower bound on the number of iterations of primal-dual interior-point methods for linear programming. Technical report, Cornell University Operations Research and Industrial Engineering (1993)Google Scholar
  18. 18.
    Todd, M.J., Ye, Y.: A lower bound on the number of iterations of long-step primal-dual linear programming algorithms. Ann. Oper. Res. 62(1), 233–252 (1996)MathSciNetCrossRefGoogle Scholar
  19. 19.
    Zhao, G.: On the relationship between the curvature integral and the complexity of path-following methods in linear programming. SIAM J. Optim. 6(1), 57–73 (1996)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Department of Industrial and Systems EngineeringLehigh UniversityBethlehemUSA

Personalised recommendations