On the Expected Condition Number of Linear Programming Problems

Numerische Mathematik

Volumn 94, Issue 3, 2003, Pages 419-478

  Cucker, Felipe ^a   Wschebor, Mario ^b  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b UNIVERSIDAD DE LA REPÚBLICA   (Uruguay)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0142055280     PISSN: 0029599X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00211-002-0385-1     Document Type: Article

References (37)

1. R. Adler: The Geometry of Random Fields. John Wiley & Sons 1981
2. L. Ahlfors: Complex Analysis (3 ed.). McGraw-Hill 1979
3. D. Brillinger: On the number of solutions of systems of random equations. Ann. of Math. Statistics 43, 534-540 (1972)
4. D. Cheung, F. Cucker: A new condition number for linear programming. Math. Program. 91, 163-174 (2001)
5. D. Cheung, F. Cucker: Probabilistic analysis of condition numbers for linear programming. Journal of Optimization Theory and Applications 114, 55-67 (2002)
6. R. Courant: Differential and Integral Calculus, Volume II. John Wiley & Sons, 1988
7. F. Cucker, J. Peña: A primal-dual algorithm for solving polyhedral conic systems with a finite-precision machine. SIAM Journal on Optimization 12, 522-554 (2001)
8. A. Dembo, O. Zeitouni: Large Deviations Techniques and Applications (2 ed.). Springer-Verlag. 1998
9. J. Demmel: On condition numbers and the distance to the nearest ill-posed problem. Numer. Math. 51, 251-289 (1987)
10. J. Demmel: Applied Numerical Linear Algebra. SIAM, 1997
11. C. Eckart, G. Young: The approximation of one matrix by another of lower rank. Psychometrika 1, 211-218 (1936)
12. A. Edelman: Eigenvalues and condition numbers of random matrices. SIAM J. of Matrix Anal. and Applic. 9, 543-556 (1988)
13. R. Freund, M. Epelman: Pre-conditioners and relations between different measures of conditioning for conic linear systems. MIT Operations Research Center Working Paper OR-344-00. (2000)
14. R. Freund, J. Vera: Condition-based complexity of convex optimization in conic linear form via the ellipsoid algorithm. SIAM Journal on Optimization 10, 155-176 (1999a)
15. R. Freund, J. Vera: Some characterizations and properties of the "distance to ill-posedness" and the condition measure of a conic linear system. Math. Program. 86, 225-260 (1999b)
16. E. Gilbert: The probability of covering a sphere with N circular caps. Biometrika 52, 323-330 (1966)
17. H. Goldstine: A History of Numerical Analysis from the 16th through the 19th Century. Springer-Verlag. 1977
18. P. Hall: Introduction to the Theory of Coverage Processes. John Wiley & Sons. 1988
19. N. Higham: Accuracy and Stability of Numerical Algorithms. SIAM. 1996
20. S. Janson: Random coverings in several dimensions. Acta Math. 156, 83-118 (1986)
21. R. Miles: The asymptotic values of certain coverage probabilities. Biometrika 56, 661-680 (1969)
22. J. Renegar: Is it possible to know a problem instance is ill-posed? Journal of Complexity 10, 1-56 (1994a)
23. J. Renegar: Some perturbation theory for linear programming. Math. Program. 65, 73-91 (1994b)
24. J. Renegar: Incorporating condition measures into the complexity theory of linear programming. SIAM J. on Optimization 5, 506-524 (1995a)
25. J. Renegar: Linear programming, complexity theory and elementary functional analysis. Math. Program. 70, 279-351 (1995b)
26. S. Smale: Complexity theory and numerical analysis. In A. Iserles (Ed.), Acta Numerica, pp. 523-551. Cambridge University Press. 1997
27. H. Solomon: Geometric Probability, Volume 28 of Regional Conference Series in Applied Mathematics. SIAM. 1978
28. G. Stewart: On scaled projections and pseudoinverses. Linear Algebra and its Applications 112, 189-193 (1989)
29. M. Todd: A Dantzig-Wolfe-like variant of Karmarkar's interior-point linear programming algorithm. Operations Research 38, 1006-1018 (1990)
30. M. Todd, L. Tunçel, Y. Ye: Characterizations, bounds and probabilistic analysis of two complexity measures for linear programming problems. Math. Program. 90, 59-69 (2001)
31. L. Trefethen, D. Bau III: Numerical Linear Algebra. SIAM. 1997
32. A. Turing: Rounding-off errors in matrix processes. Quart. J. Mech. Appl. Math. 1, 287-308 (1948)
33. S. Vavasis, Y. Ye: Condition numbers for polyhedra with real number data. Oper. Res. Lett. 17, 209-214 (1995)
34. S. Vavasis, Y. Ye: A primal-dual interior point method whose running time depends only on the constraint matrix. Math. Program. 74, 79-120 (1996)
35. J. Vera: On the complexity of linear programming under finite precision arithmetic. Math. Program. 80, 91-123 (1998)
36. J. von Neumann, H. Goldstine: Numerical inverting matrices of high order. Bulletin of the Amer. Math. Soc. 53, 1021-1099 (1947)
37. Y. Ye: Toward probabilistic analysis of interior-point algorithms for linear programming. Math. of Oper. Res. 19, 38-52 (1994)