Summary
We consider a family of linear optimization problems over the n-dimensional Klee—Minty cube and show that the central path may visit all of its vertices in the same order as simplex methods do. This is achieved by carefully adding an exponential number of redundant constraints that forces the central path to take at least 2n–2 sharp turns. This fact suggests that any feasible path-following interior-point method will take at least O(2n) iterations to solve this problem, whereas in practice typically only a few iterations (e.g., 50) suffices to obtain a high-quality solution. Thus, the construction potentially exhibits the worst-case iteration-complexity known to date which almost matches the theoretical iteration-complexity bound for this type of methods. In addition, this construction gives a counterexample to a conjecture that the total central path curvature is O(n).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J-P. Dedieu, G. Malajovich, and M. Shub. On the curvature of the central path of linear programming theory. Foundations of Computational Mathematics, 5:145—171, 2005.
1 J-P. Dedieu and M. Shub. Newton flow and interior point methods in linear programming. International Journal of Bifurcation and Chaos, 15:827—839, 2005.
A. Deza, T. Terlaky, and Y. Zinchenko.Polytopes and arrangements: Diameter and curvature. Operations Research Letters, 36-2:215—222, 2008.
A. Deza, E. Nematollahi, R. Peyghami, and T. Terlaky. The central path visits all the vertices of the Klee—Minty cube. Optimization Methods and Software, 21-5:851—865, 2006.
A. Deza, E. Nematollahi, and T. Terlaky. How good are interior point methods? Klee—Minty cubes tighten iteration-complexity bounds. Mathematical Programming, 113-1:1—14, 2008.
J. Gondzio. Presolve analysis of linear programs prior to applying an interior point method. INFORMS Journal on Computing, 9-1:73—91, 1997.
I. Maros. Computational Techniques of the Simplex Method. Kluwer Academic, Boston, MA.
N. Megiddo and M. Shub. Boundary behavior of interior point algorithms in linear programming. Mathematics of Operations Research, 14-1:97—146, 1989.
R. Monteiro and T. Tsuchiya. A strong bound on the integral of the central path curvature and its relationship with the iteration complexity of primal-dual path-following LP algorithms. Optimization Online, September 2005.
Yu. Nesterov and M. Todd. On the Riemannian geometry defined by self-concordant barriers and interior-point methods. Foundations of Computational Mathematics, 2:333—361, 2002.
C. Roos, T. Terlaky, and J-Ph. Vial. Theory and Algorithms for Linear Optimization: An Interior Point Approach. Springer, New York, second edition, 2006.
G. Sonnevend, J. Stoer, and G. Zhao. On the complexity of following the central path of linear programs by linear extrapolation. II. Mathematical Programming, 52:527—553, 1991.
M. Todd and Y. Ye. A lower bound on the number of iterations of long-step and polynomial interior-point linear programming algorithms. Annals of Operations Research, 62:233—252, 1996.
S. Vavasis and Y. Ye. A primal-dual interior-point method whose running time depends only on the constraint matrix. Mathematical Programming, 74:79—120, 1996.
G. Zhao and J. Stoer. Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals. Applied Mathematics and Optimization, 27:85—103, 1993.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Deza, A., Terlaky, T., Zinchenko, Y. (2009). Central Path Curvature and Iteration-Complexity for Redundant Klee—Minty Cubes. In: Gao, D., Sherali, H. (eds) Advances in Applied Mathematics and Global Optimization. Advances in Mechanics and Mathematics, vol 17. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-75714-8_7
Download citation
DOI: https://doi.org/10.1007/978-0-387-75714-8_7
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-75713-1
Online ISBN: 978-0-387-75714-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)