A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension (1985)

Cached

Download Links

by Ilan Adler , Nimrod Megiddo
Venue:JOURNAL OF THE ACM
Citations:30 - 2 self

Active Bibliography

1673 Atomic decomposition by basis pursuit – Scott Shaobing Chen, David L. Donoho, Michael, A. Saunders - 1998
651 A NEW POLYNOMIAL-TIME ALGORITHM FOR LINEAR PROGRAMMING – N. Karmarkar - 1984
474 A tutorial on support vector regression – Alex J. Smola, Bernhard Schölkopf - 2004
145 Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time – Daniel A. Spielman, Shang-hua Teng - 2003
9 IMPROVED ASYMPTOTIC ANALYSIS OF THE AVERAGE NUMBER OF STEPS PERFORMED BY THE SELF-DUAL SIMPLEX ALGORITHM – Nimrod Megiddo - 1986
332 Snopt: An SQP Algorithm For Large-Scale Constrained Optimization – Philip E. Gill, Walter Murray, Michael, Michael A. Saunders - 1997
THE EXPECTED NUMBER OF EXTREME POINTS OF A RANDOM LINEAR PROGRAM – Sancho E. Berenguer, Robert L. Smith - 1986
CHAPTER 6 On – Nimrod Megiddo
277 Simulation of Simplicity: A Technique to Cope with Degenerate Cases in Geometric Algorithms – Herbert Edelsbrunner, Ernst Peter Mücke - 1990