The Smoothed Analysis of Algorithms

Spielman and Teng [STOC '01] introduced the smoothed analysis of al­ gorithms to provide a framework in which one could explain the success in practice of algorithms and heuristics that could not be understood through the traditional worst-case and average-case analyses. In this talk, we survey some of the smoothed analyses that have been performed.

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

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

[3]  René Beier,et al.  Typical Properties of Winners and Losers in Discrete Optimization , 2006, SIAM J. Comput..

[4]  James Demmel,et al.  Applied Numerical Linear Algebra , 1997 .

[5]  Steve Smale,et al.  Complexity theory and numerical analysis , 1997, Acta Numerica.

[6]  Berthold Vöcking,et al.  Smoothed analysis of integer programming , 2007, Math. Program..

[7]  Christian Sohler,et al.  Extreme Points Under Random Noise , 2004, ESA.

[8]  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..

[9]  Kurt Mehlhorn,et al.  Smoothed Analysis of Three Combinatorial Problems , 2003, MFCS.

[10]  Friedhelm Meyer auf der Heide,et al.  Smoothed Motion Complexity , 2003, ESA.

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

[12]  René Beier,et al.  Typical properties of winners and losers in discrete optimization , 2004, STOC '04.

[13]  Shang-Hua Teng,et al.  Smoothed analysis of termination of linear programming algorithms , 2003, Math. Program..

[14]  Mario Wschebor,et al.  Smoothed analysis of kappa(A) , 2004, J. Complex..

[15]  Luca Becchetti,et al.  Average case and smoothed competitive analysis of the multi-level feedback algorithm , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[16]  D. Spielman,et al.  Smoothed Analysis of Renegar’s Condition Number for Linear Programming , 2002 .

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

[18]  Alan M. Frieze,et al.  The diameter of randomly perturbed digraphs and some applications , 2007, APPROX-RANDOM.

[19]  René Beier,et al.  Random knapsack in expected polynomial time , 2004, J. Comput. Syst. Sci..

[20]  Arvind Sankar.  Smoothed analysis of Gaussian elimination , 2004 .

[21]  Shang-Hua Teng,et al.  Smoothed Analysis (Motivation and Discrete Models) , 2003, WADS.

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

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

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

[25]  A. Edelman.  Eigenvalues and condition numbers of random matrices , 1988 .

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

[27]  B. Sudakov,et al.  On smoothed analysis in dense graphs and formulas , 2006 .

[28]  Shang-Hua Teng,et al.  Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices , 2003, SIAM J. Matrix Anal. Appl..

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

[30]  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.

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

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

[33]  Christian Sohler,et al.  Smoothed number of extreme points under uniform noise , 2004 .

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

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

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

[37]  E. Szemerédi,et al.  On the probability that a random ±1-matrix is singular , 1995 .

[38]  Shang-Hua Teng,et al.  Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time , 2001, STOC '01.