Beyond hirsch conjecture: Walks on random polytopes and smoothed complexity of the simplex method

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2006, Pages 133-142

  Vershynin, Roman ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; LINEAR PROGRAMMING; PERTURBATION TECHNIQUES; POLYNOMIALS;

CONSTANT PROBABILITY; HIRSCH CONJECTURE; SLIGHT RANDOM PERTURBATION; SPIELMAN-TENG'S BOUND;

RANDOM PROCESSES;

EID: 38749108479     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2006.19     Document Type: Conference Paper

References (7)

1. A. Deshpande, D. A. Spielman, Improved smoothed analysis of the shadow vertex simplex method, 46th IEEE FOCS, 349-356, 2005
2. D. A. Spielman, S.-H. Teng, Smoothed analysis: why the simplex algorithm usually takes polynomial time, Journal of the ACM 51 (2004), 385-463
3. S. Gaas, T. Saaty, The computational algorithm for the parametric objective function, Naval Research Logistics Quarterly 2 (1955), 39-45
4. I. Hueter, Limit theorems for the convex hull of random points in higher dimensions, Transactions of the AMS 351 (1999), 4337-4363
5. M. Ledoux, The concentration of measure phenomenon, AMS Math. Surveys and Monographs 89, 2001
6. n, Journal of Applied Probability 7 (1970), 35-48
7. n and Random Matrices, American Journal of Mathematics 112 (1990), 899-942.