Subexponential lower bounds for randomized pivoting rules for solving linear programs
نویسندگان
چکیده
The simplex algorithm is among the most widely used algorithms for solving linear programs in practice. Most deterministic pivoting rules are known, however, to need 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 α), for some α > 0) lower bounds for the two most natural, and most studied, randomized pivoting rules suggested to date. The first randomized pivoting rule we consider is Random-Edge, which among all improving pivoting steps (or edges) from the current basic feasible solution (or vertex ) chooses one uniformly at random. The second randomized pivoting rule we consider is Random-Facet, a more complicated randomized pivoting rule suggested by Matoušek, Sharir and Welzl [MSW96]. Our lower bound for the Random-Facet pivoting rule essentially matches the subexponential upper bound of Matoušek et al. [MSW96]. Lower bounds for Random-Edge and Random-Facet were known before only in abstract settings, and not for concrete linear programs. Our lower bounds are 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. We start by building 2-player parity games (PGs) on which suitable randomized policy iteration algorithms perform a subexponential number of iterations. We then transform these 2-player games into 1-player Markov Decision Processes (MDPs) which correspond almost immediately to concrete linear programs. ∗Department of Computer Science, University of Munich, Germany. E-mail: [email protected]. †Department of Computer Science, Aarhus University, Denmark. Supported by the Center for Algorithmic Game Theory, funded by the Carlsberg Foundation. E-mail: [email protected]. ‡School of Computer Science, Tel Aviv University, Tel Aviv 69978, Israel. Research supported by grant no. 1306/08 of the Israel Science Foundation. E-mail: [email protected].
منابع مشابه
A Subexponential Lower Bound for Zadeh's Pivoting Rule for Solving Linear Programs and Games
The simplex algorithm is among the most widely used algorithms for solving linear programs in practice. Most pivoting rules are known, however, to need an exponential number of steps to solve some linear programs. No non-polynomial lower bounds were known, prior to this work, for Zadeh’s pivoting rule [Zad80]. Also known as the Least-Entered rule, Zadeh’s pivoting method belongs to the family o...
متن کاملA subexponential lower bound for the Least Recently Considered rule for solving linear programs and games
The simplex algorithm is among the most widely used algorithms for solving linear programs in practice. Most pivoting rules are known, however, to need an exponential number of steps to solve some linear programs. No non-polynomial lower bounds were known, prior to this work, for Cunningham’s Least Recently Considered rule [5], which belongs to the family of history-based rules. Also known as t...
متن کاملRandom-Facet and Random-Bland require subexponential time even for shortest paths
The Random-Facet algorithm of Kalai and of Matoušek, Sharir and Welzl is an elegant randomized algorithm for solving linear programs and more general LP-type problems. Its expected subexponential time of 2 √ , where m is the number of inequalities, makes it the fastest known combinatorial algorithm for solving linear programs. We previously showed that Random-Facet performs an expected number o...
متن کاملExponential Lower Bounds for Solving Infinitary Payoff Games and Linear Programs
Parity games form an intriguing family of infinitary payoff games whose solution is equivalent to the solution of important problems in automatic verification and automata theory. They also form a very natural subclass of mean and discounted payoff games, which in turn are very natural subclasses of turn-based stochastic payoff games. From a theoretical point of view, solving these games is one...
متن کاملRandomized Simplex Algorithms on Klee-Minty Cubes
We investigate the behavior of randomized simplex algorithms on special linear programs. For this, we develop combinatorial models for the Klee-Minty cubes [17] and similar linear programs with exponential decreasing paths. The analysis of two most natural randomized pivot rules on the Klee-Minty cubes leads t o (nearly) quadratic lower bounds for the complexity of linear programming with rando...
متن کامل