|
| This Article | ||
| | ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
35th Annual Symposium on Foundations of Computer Science (FOCS 1994)
Santa Fe, NM, USA
November 20-November 22
ISBN: 0-8186-6580-7
| ASCII Text | x | ||
| B. Gartner, G.M. Ziegler, "Randomized simplex algorithms on Klee-Minty cubes," Foundations of Computer Science, IEEE Annual Symposium on, pp. 502-510, 35th Annual Symposium on Foundations of Computer Science (FOCS 1994), 1994. | |||
| BibTex | x | ||
| @article{ 10.1109/SFCS.1994.365741, author = {B. Gartner and G.M. Ziegler}, title = {Randomized simplex algorithms on Klee-Minty cubes}, journal ={Foundations of Computer Science, IEEE Annual Symposium on}, volume = {0}, year = {1994}, isbn = {0-8186-6580-7}, pages = {502-510}, doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.1994.365741}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Foundations of Computer Science, IEEE Annual Symposium on TI - Randomized simplex algorithms on Klee-Minty cubes SN - 0-8186-6580-7 SP502 EP510 A1 - B. Gartner, A1 - G.M. Ziegler, PY - 1994 KW - quadratic worst-case behavior KW - randomized simplex algorithms KW - Klee-Minty cubes KW - linear programs KW - combinatorial models KW - quadratic lower bounds KW - complexity KW - quadratic upper bounds VL - 0 JA - Foundations of Computer Science, IEEE Annual Symposium on ER - | |||
We investigate the behavior of randomized simplex algorithms on special linear programs. For this, we develop combinatorial models for the Klee-Minty cubes (1972) and similar linear programs with exponential decreasing paths. The analysis of two most natural randomized pivot rules on the Klee-Minty cubes leads to (nearly) quadratic lower bounds for the complexity of linear programming with random pivots. Thus we disprove two bounds conjectured in the literature. At the same lime, we establish quadratic upper bounds for random pivots on the linear programs under investigation. This motivates the question whether some randomized pivot rules possibly have quadratic worst-case behavior on general linear programs.
Index Terms:
quadratic worst-case behavior, randomized simplex algorithms, Klee-Minty cubes, linear programs, combinatorial models, quadratic lower bounds, complexity, quadratic upper bounds
Citation:
B. Gartner, G.M. Ziegler, "Randomized simplex algorithms on Klee-Minty cubes," focs, pp.502-510, 35th Annual Symposium on Foundations of Computer Science (FOCS 1994), 1994
Usage of this product signifies your acceptance of the Terms of Use.