Probabilistic analysis of condition numbers for linear programming

Journal of Optimization Theory and Applications

Volumn 114, Issue 1, 2002, Pages 55-67

  Cheung, D ^a   Cucker, F ^a  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

condition numbers; linear programming; probabilistic analysis of algorithms

Indexed keywords

C (PROGRAMMING LANGUAGE); NUMBER THEORY;

ANALYSIS OF ALGORITHMS; CONDITION NUMBERS; EXPECTED VALUES; FEASIBILITY PROBLEM; LINEAR-PROGRAMMING; M-MATRICES; M-MATRIX; PROBABILISTIC ANALYSE OF ALGORITHM; PROBABILISTIC ANALYSIS;

LINEAR PROGRAMMING;

EID: 0036262238     PISSN: 00223239     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1015460004163     Document Type: Article

References (14)

1. CHEUNG, D., and CUCKER, F., A New Condition Number for Linear Programming, Mathematical Programming, Vol. 91A, pp. 163-174, 2001.
2. RENEGAR, J., Some Perturbation Theory for Linear Programming, Mathematical Programming, Vol. 65, pp. 73-91, 1994.
3. RENEGAR, J., Incorporating Condition Measures into the Complexity Theory of Linear Programming, SIAM Journal on Optimization, Vol. 5, pp. 506-524, 1995.
4. RENEGAR, J., Linear Programming, Complexity Theory, and Elementary Functional Analysis, Mathematical Programming, Vol. 70, pp. 279-351, 1995.
5. FREUND, R., and VERA, J., Condition-Based Complexity of Convex Optimization in a Conic Linear Form via the Ellipsoid Algorithm, SIAM Journal on Optimization, Vol. 10, pp. 155-176, 1999.
6. FREUND, R., and VERA, J., Some Characterizations and Properties of the Distance to Ill-Posedness and the Condition Measure of a Conic Linear System, Mathematical Programming, Vol. 86, pp. 225-260, 1999.
7. VERA, J., On the Complexity of Linear Programming under Finite Precision Arithmetic, Mathematical Programming, Vol. 80, pp. 91-123, 1998.
8. CUCKER, F., and PEÑA, J., A Primal-Dual Algorithm for Solving Polyhedral Conic Systems with a Finite-Precision Machine, SIAM Journal of Optimization, Vol. 12, pp. 522-554, 2002.
9. YE, Y., Toward Probabilistic Analysis of Interior-Point Algorithms for Linear Programming, Mathematics of Operations Research, Vol. 19, pp. 38-52, 1994.
10. VAVASIS, S., and YE, Y., Condition Numbers for Polyhedra with Real Number Data, Operations Research Letters, Vol. 17, pp. 209-214, 1995.
11. VAVASIS, S., and YE, Y., A Primal-Dual Interior-Point Method whose Running Time Depends on Only the Constraint Matrix, Mathematical Programming, Vol. 74, pp. 79-120, 1996.
12. TODD, M., TUNÇEL, L., and YE, Y., Characterizations, Bounds, and Probabilistic Analysis of Two Complexity Measures for Linear Programming Problems, Mathematical Programming, Vol.90, pp. 59-69, 2001.
13. BLUM, L., CUCKER, F., SHUB, M., and SMALE, S., Complexity and Real Computation, Springer Verlag, New York, NY, 1998.
14. HALL, P., Introduction to the Theory of Coverage Processes, John Wiley and Sons, New York, NY, 1988.