Upper and Lower Bounds on the Smoothed Complexity of the Simplex Method

The simplex method for linear programming is known to be highly efficient in practice, and understanding its performance from a theoretical perspective is an active research topic. The framework of smoothed analysis, first introduced by Spielman and Teng (JACM '04) for this purpose, defines the smoothed complexity of solving a linear program with 𝑑 variables and 𝑛 constraints as the expected running time when Gaussian noise of variance 𝜎 2 is added to the LP data. We prove that the smoothed complexity of the simplex method is 𝑂(𝜎 -3/2 𝑑 13/4 log 5/4 𝑛), improving the dependence on 1/𝜎 compared to the previous bound of 𝑂(𝜎 -2 𝑑 2 √︁ log 𝑛). We accomplish this through a new analysis of the shadow bound, key to earlier analyses as well. Illustrating the power of our new approach, we moreover prove a nearly tight upper bound on the smoothed complexity of two-dimensional polygons. We also establish the first non-trivial lower bound on the smoothed complexity of the simplex method, proving that the shadow vertex simplex method requires, with a given auxiliary objective, at least Ω min 𝜎 -1/2 𝑑 -1/2 log -1/4 𝑑, 2 𝑑 pivot steps with high probability. A key part of our analysis is a new variation on the extended formulation for the regular 2 𝑘 -gon. We end with a numerical experiment that suggests our lower bound could be further improved.