On the complexity of linear programming under finite precision arithmetic

Mathematical Programming, Series B

Volumn 80, Issue 1, 1998, Pages 91-123

  Vera, Jorge R ^a  

^a UNIVERSITY OF CHILE   (Chile)

Author keywords

Complexity of linear programming; Conditioning; Error analysis; Interior point methods

Indexed keywords

EID: 0002882095     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01582132     Document Type: Article

References (14)

1. S. Smale, Some remarks on the foundations of numerical analysis, SIAM Review 32 (1990) 211-220.
2. J. Renegar, Incorporating Condition Measures into the Complexity Theory of Linear Programming, SIAM Journal on Optimization 5 (3) (1995) 506-524.
3. J. Vera, Ill-Posedness in mathematical programming and problem solving with approximate data, Ph.D. Dissertation, Cornell University, Ithaca, NY, 1992.
4. J. Vera, Ill-Posedness and the complexity of deciding existence of solutions to linear programs, SIAM Journal on Optimization 6 (3) (1996) 549-569.
5. J. Vera, Ill-Posedness and the computation of solutions to linear programs with approximate data, Working paper, Dept. of Industrial Engineering, University of Chile.
6. J. Renegar, A polynomial-time algorithm based on Newton's method for linear programming, Mathematical Programming 40 (1988) 59-94.
7. Nesterov, Y., A. Nemirovskii, Interior-point polynomial algorithms in convex programming, in: SIAM Studies in Applied Mathematics No. 13, SIAM, Philadelphia, PA, 1994.
8. D. Den Hertog, C. Roos, T. Terlaky, On the classical logarithmic barrier function method for a class of smooth convex programming problems, Journal of Optimization Theory and Applications 73 (1) (1992) 1-25.
9. F. Jarre, Interior-point methods for convex programming. Applied Mathematics and Optimization 26 (1992) 287-311.
10. J. Renegar, Linear programming, complexity theory and elementary functional analysis, Mathematical Programming 70 (3) (1995) 279-351.
11. G.H. Golub, C. Van Loan, Matrix Computations, second ed., Johns Hopkins Univ. Press, Baltimore, MD, 1989.
12. J.H. Wilkinson, The Algebraic Eigenvalue Problem, Oxford Univ. Press, Oxford, 1965.
13. R. Freund, J. Vera, Some characterization and properties of the "distance to ill-posedness" and the condition measure of a conic linear system, Working paper, November 1995.
14. J. Renegar, Some perturbation theory for linear programming, Mathematical Programming 65 (1994) 73-91.