Smoothed Analysis of Interior-Point Algorithms: Termination

We perform a smoothed analysis of the termination phase of an interior-point method. By combining this analysis with the smoothed analysis of Renegar’s interior-point algorithm in [DST02], we show that the smoothed complexity of an interior-point algorithm for linear programming is O(m 3 log(m/�)). In contrast, the best known bound on the worst-case complexity of linear programming is O(m 3 L), where L could be as large as m. We include an introduction to smoothed analysis and a tutorial on proof techniques that have been useful in smoothed analyses.

[1]  William Y. Sit,et al.  Worst case behavior of the steepest edge simplex method , 1979, Discret. Appl. Math..

[2]  Pravin M. Vaidya,et al.  An algorithm for linear programming which requires O(((m+n)n2+(m+n)1.5n)L) arithmetic operations , 1990, Math. Program..

[3]  V. Chvátal,et al.  Notes on Bland’s pivoting rule , 1978 .

[4]  Yinyu Ye,et al.  Probabilistic Analysis of an Infeasible-Interior-Point Algorithm for Linear Programming , 1999, Math. Oper. Res..

[5]  Florian A. Potra,et al.  Average Performance of a Self–Dual Interior Point Algorithm for Linear Programming , 1993 .

[6]  Michael J. Todd,et al.  Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems , 1986, Math. Program..

[7]  Stephen J. Wright.  Primal-Dual Interior-Point Methods , 1997, Other Titles in Applied Mathematics.

[8]  Michael J. Todd,et al.  A lower bound on the number of iterations of long-step primal-dual linear programming algorithms , 1996, Ann. Oper. Res..

[9]  J. Renegar.  Some perturbation theory for linear programming , 1994, Math. Program..

[10]  John Dunagan,et al.  Smoothed analysis of the perceptron algorithm for linear programming , 2002, SODA '02.

[11]  L. G. H. Cijan.  A polynomial algorithm in linear programming , 1979 .

[12]  Jacek Gondzio,et al.  Implementation of Interior Point Methods for Large Scale Linear Programming , 1996 .

[13]  K. Borgwardt.  The Simplex Method: A Probabilistic Analysis , 1986 .

[14]  Stephen Smale,et al.  On the average number of steps of the simplex method of linear programming , 1983, Math. Program..

[15]  N. Amenta,et al.  Deformed products and maximal shadows of polytopes , 1996 .

[16]  Michael J. Todd,et al.  A Lower Bound on the Number of Iterations of Primal-Dual Interior-Point Methods for Linear Programming , 1993 .

[17]  D. Spielman,et al.  Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time , 2004 .

[18]  Katta G. Murty,et al.  Computational complexity of parametric linear programming , 1980, Math. Program..

[19]  Yoav Seginer,et al.  The Expected Norm of Random Matrices , 2000, Combinatorics, Probability and Computing.

[20]  Joel H. Spencer,et al.  Coloring Random and Semi-Random k-Colorable Graphs , 1995, J. Algorithms.

[21]  J. H. Wilkinson.  The algebraic eigenvalue problem , 1966 .

[22]  V. Klee,et al.  HOW GOOD IS THE SIMPLEX ALGORITHM , 1970 .

[23]  C. C. Gonzaga,et al.  An algorithm for solving linear programming programs in O(n3L) operations , 1988 .

[24]  Richard M. Karp,et al.  A simplex variant solving an m times d linear program in O(min(m2, d2) expected number of pivot steps , 1987, J. Complex..

[25]  L. Khachiyan.  Polynomial algorithms in linear programming , 1980 .

[26]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, STOC '84.

[27]  C. C. Gonzaga,et al.  An Algorithm for Solving Linear Programming Problems in O(n 3 L) Operations , 1989 .

[28]  Robert G. Jeroslow,et al.  The simplex algorithm with the pivot rule of maximizing criterion improvement , 1973, Discret. Math..

[29]  James Renegar,et al.  Incorporating Condition Measures into the Complexity Theory of Linear Programming , 1995, SIAM J. Optim..

[30]  James Renegar,et al.  A polynomial-time algorithm, based on Newton's method, for linear programming , 1988, Math. Program..

[31]  James Renegar,et al.  Linear programming, complexity theory and elementary functional analysis , 1995, Math. Program..

[32]  Nimrod Megiddo,et al.  A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension , 1984, STOC '84.

[33]  John Dunagan,et al.  Smoothed Analysis of Interior-Point Algorithms: Condition Number , 2003, ArXiv.