Subexponential lower bounds for randomized pivoting rules for the simplex algorithm

@inproceedings{Friedmann2011SubexponentialLB,
  title={Subexponential lower bounds for randomized pivoting rules for the simplex algorithm},
  author={Oliver Friedmann and Thomas Dueholm Hansen and Uri Zwick},
  booktitle={STOC '11},
  year={2011}
}
The simplex algorithm is among the most widely used algorithms for solving linear programs in practice. With essentially all deterministic pivoting rules it is known, however, to require an exponential number of steps to solve some linear programs. No non-polynomial lower bounds were known, prior to this work, for randomized pivoting rules. We provide the first subexponential (i.e., of the form 2Ω(nα), for some α>0) lower bounds for the two most natural, and most studied, randomized pivoting… 
A Subexponential Lower Bound for Zadeh's Pivoting Rule for Solving Linear Programs and Games
TLDR
The first subexponential lower bound of the form 2Ω(√n) lower bound is obtained by utilizing connections between pivoting steps performed by simplex-based algorithms and improving switches performed by policy iteration algorithms for 1-player and 2-player games.
DRAFT March 20 , 2012 A subexponential lower bound for the Least Recently Considered rule for solving linear programs and games
TLDR
The first subexponential lower bound for Cunningham’s Least Recently Considered rule, also known as the ROUND-ROBIN rule, is provided by utilizing connections between pivoting steps performed by simplex-based algorithms and improving switches performed by policy iteration algorithms for 1player and 2-player games.
An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm
TLDR
An improved version of Kalai's pivoting rule is presented, for which the expected number of primal pivoting steps is at most min{2O(√(n-d),log(d/(n-D),)},2O (√{d,log(( n-d)/d}},)}.
Exponential Lower Bounds for History-Based Simplex Pivot Rules on Abstract Cubes
  • A. Thomas
  • Computer Science, Mathematics
    ESA
  • 2017
The behavior of the simplex algorithm is a widely studied subject. Specifically, the question of the existence of a polynomial pivot rule for the simplex algorithm is of major importance. Here, we
Random-Edge Is Slower Than Random-Facet on Abstract Cubes
TLDR
It is shown that in the AUSO setting, Random-Edge is slower than Random-Facet, and improves on a 2^{Omega(sqrt^3(n))} lower bound of Matousek and Szabo.
The Polyhedral Geometry of Pivot Rules and Monotone Paths
Motivated by the analysis of the performance of the simplex method we study the behavior of families of pivot rules of linear programs. We introduce normalized-weight pivot rules which are
The Complexity of the Simplex Method
TLDR
This paper uses the known connection between Markov decision processes (MDPs) and linear programming, and an equivalence between Dantzig's pivot rule and a natural variant of policy iteration for average-reward MDPs to prove that it is PSPACE-complete to find the solution that is computed by the simplex method using Dantzes' pivot rule.
A subexponential lower bound for the random facet algorithm for parity games
TLDR
This paper focuses in this paper on the algorithm of Matoušek, Sharir and Welzl and refers to it as the Random Facet algorithm, and constructed a family of abstract optimization problems such that the expected running time of the Random facial recognition algorithm, when run on a random instance from this family, is close to the subexponential upper bound.
On the Simplex method for 0/1 polytopes
We present new pivot rules for the Simplex method for LPs over 0/1 polytopes. We show that the number of non-degenerate steps taken using these rules is strongly polynomial and even linear in the
The Niceness of Unique Sink Orientations
TLDR
Niceness implies natural upper bounds for Random Edge and it is shown that Random Edge is polynomial on at least $n^{\Omega(2^n)}$ many (possibly cyclic) USO.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 55 REFERENCES
A Subexponential Lower Bound for Zadeh's Pivoting Rule for Solving Linear Programs and Games
TLDR
The first subexponential lower bound of the form 2Ω(√n) lower bound is obtained by utilizing connections between pivoting steps performed by simplex-based algorithms and improving switches performed by policy iteration algorithms for 1-player and 2-player games.
Randomized Simplex Algorithms on Klee-Minty Cubes
TLDR
This work disproves two bounds (for the expected running time of the random-edge simplex algorithm on Klee-Minty cubes) conjectured in the literature and establishes quadratic upper bounds for the expected length of a path for asimplex algorithm with random pivots on the classes of linear programs under investigation.
The Random‐Facet simplex algorithm on combinatorial cubes
  • Bernd Gärtner
  • Computer Science, Mathematics
    Random Struct. Algorithms
  • 2002
TLDR
The main new result of the paper is a proof that all actual linear programs in Matous̆ek's class are solved by RANDOM‐FACET with an expected polynomial number of $O \bigl(n^2 \bigr)$ pivot steps.
Lower Bounds for a Subexponential Optimization Algorithm
  • J. Matousek
  • Mathematics, Computer Science
    Random Struct. Algorithms
  • 1994
TLDR
Results of computer simulations for a specific linear programming problem are described, which indicate that “one‐permutation” and “move‐to‐front” variants of the Sharir–Welzl algorithm may sometimes perform much worse than the algorithm itself.
A randomized polynomial-time simplex algorithm for linear programming
TLDR
This work presents the first randomized polynomial-time simplex algorithm for linear programming, reducing the input linear program to a special form in which it merely needs to certify boundedness, and runs the shadow-vertex simplex method with a random right-hand-side vector.
A subexponential lower bound for the random facet algorithm for parity games
TLDR
This paper focuses in this paper on the algorithm of Matoušek, Sharir and Welzl and refers to it as the Random Facet algorithm, and constructed a family of abstract optimization problems such that the expected running time of the Random facial recognition algorithm, when run on a random instance from this family, is close to the subexponential upper bound.
Two New Bounds for the Random-Edge Simplex-Algorithm
We prove that the RANDOM-EDGE simplex-algorithm requires an expected number of at most $13n/\sqrt{d}$ pivot steps on any simple $d$-polytope with $n$ vertices. This is the first nontrivial upper
One line and n points.
TLDR
The process itself can be interpreted as a simple algorithm for certain 2‐variable linear programming problems, and it is proved a tight Θ(n) bound for its expected runtime, the first nontrivial bound for RANDOM‐EDGE, which goes beyond bounds for specific polytopes.
What is the Worst Case Behavior of the Simplex Algorithm
TLDR
The purpose of this paper is to explain the Klee-Minty and Jeroslow constructions, show how they can be modified to be pathological with small integral coefficients, and then suggest a 'least entered' pivot rule which forces an improving column to be entered before any other column is entered for the second time.
A survey of linear programming in randomized subexponential time
TLDR
This paper demonstrates that one of the variants of Kalai's algorithm is identical (although dual) to the algorithm of Sharir-Welzl, and the implication of Gärtner's framework on future improvements is examined more carefully.
...
1
2
3
4
5
...