skip to main content
10.1145/1993636.1993675acmconferencesArticle/Chapter ViewAbstractPublication PagesstocConference Proceedingsconference-collections
research-article
Free access

Subexponential lower bounds for randomized pivoting rules for the simplex algorithm

Published: 06 June 2011 Publication History

Abstract

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 rules suggested to date.
The first randomized pivoting rule considered 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 considered is Random-Facet, a more complicated randomized pivoting rule suggested by Kalai and by Matousek, Sharir and Welzl. Our lower bound for the Random-Facet pivoting rule essentially matches the subexponential upper bounds given by Kalai and by Matousek et al 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 solving Markov Decision Processes (MDPs).

Supplementary Material

JPG File (stoc_5_2.jpg)
MP4 File (stoc_5_2.mp4)

References

[1]
N. Amenta and G. Ziegler. Deformed products and maximal shadows of polytopes. In Advances in Discrete and Computational Geometry, pages 57--90, Providence, 1996. Amer. Math. Soc. Contemporary Mathematics 223.
[2]
D. Avis and V. Chvátal. Notes on Bland's pivoting rule. In Polyhedral Combinatorics, volume 8 of Mathematical Programming Studies, pages 24--34. Springer, 1978.
[3]
J. Balogh and R. Pemantle. The Klee-Minty random edge chain moves with linear speed. Random Structures & Algorithms, 30(4):464--483, 2007.
[4]
R. Bellman. Dynamic programming. Princeton University Press, 1957.
[5]
D. Bertsekas. Dynamic programming and optimal control. Athena Scientific, second edition, 2001.
[6]
A. Broder, M. Dyer, A. Frieze, P. Raghavan, and E. Upfal. The worst-case running time of the random simplex algorithm is exponential in the height. Inf. Process. Lett., 56(2):79--81, 1995.
[7]
V. Chvátal. Linear programming. A Series of Books in the Mathematical Sciences. W. H. Freeman and Company, New York, 1983.
[8]
G. Dantzig. Linear programming and extensions. Princeton University Press, 1963.
[9]
C. Derman. Finite state Markov decision processes. Academic Press, 1972.
[10]
E. Emerson and C. Jutla. Tree automata, μ-calculus and determinacy. In Proceedings of the 32nd FOCS, pages 368--377, 1991.
[11]
E. A. Emerson, C. S. Jutla, and A. P. Sistla. On model-checking for fragments of μ-calculus. In Proc. of 5th CAV, pages 385--396, 1993.
[12]
J. Fearnley. Exponential lower bounds for policy iteration. In Proc. of 37th ICALP, pages 551--562, 2010.
[13]
O. Friedmann. An exponential lower bound for the parity game strategy improvement algorithm as we know it. In Proc. of 24th LICS, pages 145--156, 2009.
[14]
O. Friedmann. An exponential lower bound for the latest deterministic strategy iteration algorithms. Selected Papers of the Conference "Logic in Computer Science 2009" (to appear), 2010. A preprint available from http://www.tcs.ifi.lmu.de/friedman.
[15]
O. Friedmann. A subexponential lower bound for Zadeh's pivoting rule for solving linear programs and games. In Proc. of 15th IPCO, 2011. To appear.
[16]
O. Friedmann, T. Hansen, and U. Zwick. A subexponential lower bound for the random facet algorithm for parity games. In Proc. of 22nd SODA, pages 202--216, 2011.
[17]
B. Gärtner. A subexponential algorithm for abstract optimization problems. SIAM Journal on Computing, 24:1018--1035, 1995.
[18]
B. Gärtner. The random-facet simplex algorithm on combinatorial cubes. Random Structures & Algorithms, 20(3):353--381, 2002.
[19]
B. Gärtner, M. Henk, and G. Ziegler. Randomized simplex algorithms on Klee-Minty cubes. Combinatorica, 18(3):349--372, 1998.
[20]
B. Gärtner and V. Kaibel. Two new bounds for the random-edge simplex-algorithm. SIAM J. Discrete Math., 21(1):178--190, 2007.
[21]
B. Gärtner, F. Tschirschnitz, E. Welzl, J. Solymosi, and P. Valtr. One line and n points. Random Structures & Algorithms, 23(4):453--471, 2003.
[22]
D. Goldfarb and W. Sit. Worst case behavior of the steepest edge simplex method. Discrete Applied Mathematics, 1(4):277 -- 285, 1979.
[23]
M. Goldwasser. A survey of linear programming in randomized subexponential time. SIGACT News, 26(2):96--104, 1995.
[24]
E. Grädel, W. Thomas, and T. Wilke, editors. Automata, Logics, and Infinite Games. A Guide to Current Research, volume 2500 of LNCS. Springer, 2002.
[25]
M. Grötschel, L. Lovász, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization. Springer Verlag, 1988.
[26]
T. Hansen, P. Miltersen, and U. Zwick. Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor. In Proc. of 2nd Symposium on Innovations in Computer Sciece (ICS), pages 253--263, 2011.
[27]
R. Howard. Dynamic programming and Markov processes. MIT Press, 1960.
[28]
R. G. Jeroslow. The simplex algorithm with the pivot rule of maximizing criterion improvement. Discrete Mathematics, 4(4):367--377, 1973.
[29]
G. Kalai. A subexponential randomized simplex algorithm (extended abstract). In Proc. of 24th STOC, pages 475--482, 1992.
[30]
G. Kalai. Linear programming, the simplex algorithm and simple polytopes. Mathematical Programming, 79:217--233, 1997.
[31]
G. Kalai and D. Kleitman. Quasi-polynomial bounds for the diameter of graphs and polyhedra. Bull. Amer. Math. Soc., 26:315--316, 1992.
[32]
N. Karmarkar. A new polynomial-time algorithm for linear programming. Combinatorica, 4(4):373--395, 1984.
[33]
J. Kelner and D. Spielman. A randomized polynomial-time simplex algorithm for linear programming. In Proc. of 38th STOC, pages 51--60, 2006.
[34]
L. Khachiyan. A polynomial time algorithm in linear programming. Soviet Math. Dokl., 20:191--194, 1979.
[35]
V. Klee and G. J. Minty. How good is the simplex algorithm? In O. Shisha, editor, Inequalities III, pages 159---175. Academic Press, New York, 1972.
[36]
Y. Mansour and S. Singh. On the complexity of policy iteration. In Proc. of the 15th UAI, pages 401--408, 1999.
[37]
J. Matousek. Lower bounds for a subexponential optimization algorithm. Random Structures and Algorithms, 5(4):591--608, 1994.
[38]
J. Matousek and B. Gärtner. Understanding and using linear programming. Springer, 2007.
[39]
J. Matousek, M. Sharir, and E. Welzl. A subexponential bound for linear programming. Algorithmica, 16(4--5):498--516, 1996.
[40]
J. Matousek and T. Szabó. RANDOM EDGE can be exponential on abstract cubes. Advances in Mathematics, 204(1):262--277, 2006.
[41]
M. Melekopoglou and A. Condon. On the complexity of the policy improvement algorithm for Markov decision processes. ORSA Journal on Computing, 6(2):188--192, 1994.
[42]
Y. Nesterov and A. Nemirovskii. Interior Point Polynomial Methods in Convex Programming. SIAM, 1994.
[43]
M. Puterman. Markov decision processes. Wiley, 1994.
[44]
F. Santos. A counterexample to the hirsch conjecture. CoRR, abs/1006.2814v1, 2010.
[45]
S. Schewe. An optimal strategy improvement algorithm for solving parity and payoff games. In Proc. of 17th CSL, pages 369--384, 2008.
[46]
A. Schrijver. Theory of Linear and Integer Programming. John Wiley & Sons, 1986.
[47]
L. Shapley. Stochastic games. Proc. Nat. Acad. Sci. U.S.A., 39:1095--1100, 1953.
[48]
D. Spielman and S. Teng. Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. Journal of the ACM, 51(3):385--463, 2004.
[49]
C. Stirling. Local model checking games. In Proceedings of the 6th International Conference on Concurrency Theory (CONCUR'95), volume 962 of LNCS, pages 1--11. Springer, 1995.
[50]
Y. Ye. Interior Point Algorithms: Theory and Analysis. Wiley-Interscience, 1997.
[51]
Y. Ye. The simplex method is strongly polynomial for the Markov decision problem with a fixed discount rate. Available at http://www.stanford.edu/yyye/simplexmdp1.pdf, 2010.
[52]
N. Zadeh. What is the worst case behavior of the simplex algorithm? Technical Report 27, Department of Operations Research, Stanford, 1980.

Cited By

View all
  • (2024)Deterministic Sub-exponential Algorithm for Discounted-sum Games with Unary WeightsProceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/3661814.3662080(1-12)Online publication date: 8-Jul-2024
  • (2024)The hexatope and octatope abstract domains for neural network verificationFormal Methods in System Design10.1007/s10703-024-00457-y64:1-3(178-199)Online publication date: 17-Jun-2024
  • (2023)The Smoothed Complexity of Policy Iteration for Markov Decision ProcessesProceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585220(1890-1903)Online publication date: 2-Jun-2023
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
STOC '11: Proceedings of the forty-third annual ACM symposium on Theory of computing
June 2011
840 pages
ISBN:9781450306911
DOI:10.1145/1993636
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 06 June 2011

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Markov decision processes
  2. linear programming
  3. randomized pivoting rules
  4. simplex algorithm

Qualifiers

  • Research-article

Conference

STOC'11
Sponsor:
STOC'11: Symposium on Theory of Computing
June 6 - 8, 2011
California, San Jose, USA

Acceptance Rates

STOC '11 Paper Acceptance Rate 84 of 304 submissions, 28%;
Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Upcoming Conference

STOC '25
57th Annual ACM Symposium on Theory of Computing (STOC 2025)
June 23 - 27, 2025
Prague , Czech Republic

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)169
  • Downloads (Last 6 weeks)29
Reflects downloads up to 19 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Deterministic Sub-exponential Algorithm for Discounted-sum Games with Unary WeightsProceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/3661814.3662080(1-12)Online publication date: 8-Jul-2024
  • (2024)The hexatope and octatope abstract domains for neural network verificationFormal Methods in System Design10.1007/s10703-024-00457-y64:1-3(178-199)Online publication date: 17-Jun-2024
  • (2023)The Smoothed Complexity of Policy Iteration for Markov Decision ProcessesProceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585220(1890-1903)Online publication date: 2-Jun-2023
  • (2023)Upper and Lower Bounds on the Smoothed Complexity of the Simplex MethodProceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585124(1904-1917)Online publication date: 2-Jun-2023
  • (2023)Improved Complexity Analysis of Quasi-Polynomial Algorithms Solving Parity GamesUnity of Logic and Computation10.1007/978-3-031-36978-0_22(275-286)Online publication date: 19-Jul-2023
  • (2023)The Octatope Abstract Domain for Verification of Neural NetworksFormal Methods10.1007/978-3-031-27481-7_26(454-472)Online publication date: 3-Mar-2023
  • (2022)Pivot Rules for Circuit-Augmentation Algorithms in Linear OptimizationSIAM Journal on Optimization10.1137/21M141999432:3(2156-2179)Online publication date: 1-Jan-2022
  • (2022)An exponential lower bound for Zadeh’s pivot ruleMathematical Programming10.1007/s10107-022-01848-x199:1-2(865-936)Online publication date: 19-Jul-2022
  • (2022)Universal Algorithms for Parity Games and Nested FixpointsPrinciples of Systems Design10.1007/978-3-031-22337-2_12(252-271)Online publication date: 29-Dec-2022
  • (2021)Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNPFoundations of Software Science and Computation Structures10.1007/978-3-030-71995-1_22(427-447)Online publication date: 23-Mar-2021
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media