Solving linear programs with finite precision: I. Condition numbers and random programs

Mathematical Programming

Volumn 99, Issue 1, 2004, Pages 175-196

  Cheung, Dennis ^a   Cucker, Felipe ^a  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; ITERATIVE METHODS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING;

ELLIPSOID METHOD; FLOATING-POINT ARITHMETIC; INTERIOR-POINT METHOD; TIME POLYNOMIALS;

LINEAR PROGRAMMING;

EID: 18144418311     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10107-003-0393-7     Document Type: Article

References (28)

1. Cheung, D., Cucker, F.: A new condition number for linear programming. Math. Program. 91, 163-174 (2001)
2. Cheung, D., Cucker, F.: Probabilistic analysis of condition numbers for linear programming. J. Optim. Theory and Appl. 114, 55-67 (2002)
3. Cheung, D., Cucker, F.: Solving linear programs with finite precision: II. Algorithms. Manuscript in preparation, 2003
4. Cucker, F., Wschebor, M.: On the expected condition number of linear programming problems. Numer. Math. 94, 419-478 (2003)
5. Dantzig, G.B.: Maximization of a linear function of variables subject to linear inequalities. In Tj.C. Koopmans, ed. Activity Analysis of Production and Allocation, p. 339-347. John Wiley & Sons, 1951
6. Dunagan, J., Spielman, D.A., Teng, S.-H.: Smoothed analysis of Renegar's condition number for linear programming. Preprint available at http://theory.lcs.mit.edu/spielman, 2003
7. Edelman, A.: Eigenvalues and condition numbers of random matrices. SIAM J. Matrix Anal. Applic. 9, 543-556 (1988)
8. Freund, R., Epelman, M.: Pre-conditioners and relations between different measures of conditioning for conic linear systems. MIT Operations Research Center Working Paper OR-344-00, 2000
9. Freund, R.M., Vera, J.R.: Condition-based complexity of convex optimization in conic linear form via the ellipsoid algorithm. SIAM J. Optim. 10, 155-176 (1999)
10. Freund, R.M., Vera, J.R.: Some characterizations and properties of the distance to ill-posedness and the condition measure of a conic linear system. Math. Program. 86, 225-260 (1999)
11. Hall, P.: Introduction to the Theory of Coverage Processes. John Wiley & Sons, 1988
12. Higham, N.: Accuracy and Stability of Numerical Algorithms. SIAM, 1996
13. Karmarkar, N.: A new polynomial time algorithm for linear programming. Combinatorica 4, 373-395 (1984)
14. Khachijan, L.G.: A polynomial algorithm in linear programming. Dokl. Akad. Nauk SSSR 244, 1093-1096 (1979);
15. In Russian, English translation in Soviet Math. Dokl. 20, 191-194 (1979)
16. Klee, V., Minty, G.J.: How good is the simplex method. In O. Shisha, ed, Inequalities III, p. 159-175. Academic Press, 1972
17. Renegar, J.: Is it possible to know a problem instance is ill-posed? J. Complex. 10, 1-56 (1994)
18. Renegar, J.: Some perturbation theory for linear programming. Math. Program. 65, 73-91 (1994)
19. Renegar, J.: Incorporating condition measures into the complexity theory of linear programming. SIAM J. Optim. 5, 506-524 (1995)
20. Renegar, J.: Linear programming, complexity theory and elementary functional analysis. Math. Program. 70, 279-351 (1995)
21. Stewart, G.W.: On scaled projections and pseudoinverses. Linear Algebra Appl. 112, 189-193 (1989)
22. Todd, M.J.: A Dantzig-Wolfe-like variant of Karmarkar's interior-point linear programming algorithm. Oper. Res. 38, 1006-1018 (1990)
23. Todd, M.J., Tunçel, L., Ye, Y.: Characterizations, bounds and probabilistic analysis of two complexity measures for linear programming problems. Math. Program. 90, 59-69 (2001)
24. Vavasis, S.A., Ye, Y.: Condition numbers for polyhedra with real number data. Oper. Res. Lett. 17, 209-214 (1995)
25. Vavasis, S.A., Ye, Y.: A primal-dual interior point method whose running time depends only on the constraint matrix. Math. Program. 74, 79-120 (1996)
26. Wright, S.: Primal-Dual Interior-Point Methods. SIAM, 1997
27. Ye, Y.: Toward probabilistic analysis of interior-point algorithms for linear programming. Math. Oper. Res. 19, 38-52 (1994)
28. Ye, Y.: Interior Point Algorithms: Theory and Analysis. John Wiley & Sons, 1997