Condition measures and properties of the central trajectory of a linear program

Mathematical Programming, Series B

Volumn 83, Issue 1, 1998, Pages 1-28

  Nunez, Manuel A ^a   Freund, Robert M ^b  

^a CHAPMAN UNIVERSITY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Analytic center; Approximate data; Approximate solutions; Central trajectory; Condition measures; Interior point methods; Linear Programming; Perturbation theory

Indexed keywords

EID: 0002822882     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02680548     Document Type: Article

References (32)

1. I. Adler, R.D.C. Monteiro, Limiting behavior of the affine scaling continuous trajectories for linear programming problems, Mathematical Programming 50 (1) (1991) 29-51.
2. S.A. Ashmanov, Stability conditions for linear programming problems, U.S.S.R. Comput. Math. and Math. Phys 21 (6) (1981) 40-49.
3. M.S. Bazaraa, H.D. Sherali, C.M. Shetty, Nonlinear Programming, Theory and Algorithms, 2nd ed., Wiley, New York, 1993.
4. G.B. Dantzig, Linear Programming and Extensions, Princeton University Press, Princeton, NJ, 1963.
5. 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.
6. S. Filipowski, On the complexity of solving linear programs specified with approximate data and known to be feasible, Technical Report, Department of Industrial and Manufacturing Systems Engineering, Iowa State University, May 1994.
7. S. Filipowski, On the complexity of solving sparse symmetric linear programs specified with approximate data, Technical Report. Department of Industrial and Manufacturing Systems Engineering, Iowa State University, December 1994.
8. S. Filopowski, On the complexity of solving feasible systems of linear inequalities specified with approximate data, Mathematical Programming 71 (3) (1995) 259-288.
9. R.M. Freund, J.R. Vera, Some characterizations and properties of the "distance to ill-posedness" in conic linear systems, MIT Sloan Working Paper 3862-95-MSA, Sloan School of Management, Massachusetts Institute of Technology, 1995.
10. D. Gale, The Theory of Linear Economic Models, McGraw-Hill, New York, 1960.
11. G.H. Golub, C.F. Van Loan, Matrix Computations, 3rd ed., Johns Hopkins University Press, New York, 1997.
12. C.C. Gonzaga, Path following methods for linear programming, SIAM Review 34 (2) (1992) 167-227.
13. B. Jansen, C. Roos, T. Terlaky, A Short survey on ten years interior point methods, Technical Report 95-45, Delft University of Technology, 1995.
14. L.G. Khachiyan, A polynomial algorithm in linear programming, Soviet Math. Dokl. 20 (1) (1979) 191-194.
15. D.G. Luenberger, Optimization by Vector Space Methods, Wiley, New York, 1968.
16. O.L. Mangasarian, A stable theorem of the alternative: An extension of the Gordan theorem, Linear Algebra and Its Applications 41 (1981) 209-223.
17. G.L. Nemhauser, L.A. Wolsey, Integer and Combinatorial Optimization, Wiley, New York, 1988.
18. Y. Nesterov, A. Nemirovskii, Interior-Point Polynomial Algorithms in Convex Programming, SIAM, Philadelphia, PA, 1994.
19. J. Renegar, Some perturbation theory for linear programming, Mathematical Programming 65 (1) (1994) 73-91.
20. J. Renegar, Incorporating condition measures into the complexity theory of linear programming, SIAM Journal on Optimization 5 (3) (1995) 506-524.
21. J. Renegar, Linear Programming, complexity theory, and elementary functional analysis, Mathematical Programming 70 (3) (1995) 279-351.
22. J. Renegar, Condition numbers, the barrier method, and the conjugate gradient method, SIAM Journal on Optimization 6 (4) (1996) 879-912.
23. S.M. Robinson, Stability theory for systems of inequalities. Part I: Linear systems, SIAM Journal on Numerical Analysis 12 (5) (1975) 754-769.
24. S.M. Robinson, Stability theory for systems of inequalities. Part II: Nonlinear systems, SIAM Journal on Numerical Analysis 13 (4) (1976) 497-513.
25. S.M. Robinson, A characterization of stability in linear programming, Operations Research 25 (3) (1977) 435-47.
26. G. Sonnevend, An "analytic" center for polyhedrons and new classes of global algorithms for linear (smooth, convex) optimization, Technical Report, Department of Numerical Analysis, Institute of Mathematics, Eötvös University, Budapest, Preprint, 1985, pp. 6-8.
27. G. Sonnevend, A new method for solving a set of linear (convex) inequalities and its applications for identification and optimization, Technical Report, Department of Numerical Analysis, Institute of Mathematics, Eötvös University, Budapest, Preprint, 1985, pp. 6-8.
28. J.R. Vera, Ill-posedness and the computation of solutions to linear programs with approximate data, Technical Report, Cornell University, May 1992.
29. J.R. Vera, On the complexity of linear programming under finite precision arithmetic, Technical Report, Cornell University, August 1994.
30. J.R. Vera, Ill-posedness and the complexity of deciding existence of solutions to linear programs, SIAM Journal on Optimization 6 (3) (1996) 549-569.
31. A.C. Williams, Complementarity theorems for linear programming, SIAM Review 12 (1) (1970) 135-137.
32. S.J. Wright, Primal-Dual Interior-Point Methods, SIAM, Philadelphia, PA, 1997.