Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming

Mathematical Programming, Series B

Volumn 81, Issue 1, 1998, Pages 1-21

  Todd, Michael J ^a   Ye, Yinyu ^b  

^a School of Operations Research and Industrial Engineering   (United States)

^b UNIVERSITY OF IOWA   (United States)

Author keywords

Farkas lemma; Infeasible interior point methods; Linear programming; Stopping rules

Indexed keywords

EID: 0040707227     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01584841     Document Type: Article

References (29)

1. N.K. Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica 4 (1984) 373-395.
2. A. Schrijver, Theory of Linear and Integer Programming, Wiley, Chichester, 1986.
3. C.C. Gonzaga, Path following methods for linear programming, SIAM Review 34 (2) (1992) 167-227.
4. D. den Hertog, Interior Point Approach to Linear, Quadratic and Convex Programming: Algorithms and Complexity, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1994.
5. M.J. Todd, Potential-reduction methods in mathematical programming. Mathematical Programming 76 (1996) 3-45.
6. S. Mehrotra, Y. Ye, Finding an interior point in the optimal face of linear programs, Mathematical Programming 62 (1993) 497-515.
7. S.A. Vavasis, Y. Ye, A primal-dual interior point method whose running time depends only on the constraint matrix, Mathematical Programming 74 (1996) 79-120.
8. S.M. Robinson, Bounds for the error in the solution set of a perturbed linear program, Linear Algebra and Its Applications 6 (1973) 69-81.
9. O.L. Mangasarian, A condition number for linear inequalities and linear programs, in: G. Bamberg, O. Opitz (Eds.), Methods of Operations Research, vol. 43. Verlagsgruppe Athenaum/Hain/Scriptor/Hanstein, Konigstein, 1981, pp. 3-15.
10. R.M. Freund, Dual gauge programs, with applications to quadratic programming and the minimum-norm problem, Mathematical Programming 38 (1987) 47-67.
11. J. Renegar, Some perturbation theory for linear programming, Mathematical Programming 65 (1994) 73-82.
12. A. Dax, On minimum norm solutions, Journal of Optimization Theory and Applications 76 (1993) 183-193.
13. I.I. Yeremin, Duality for improper linear and convex programming problems and methods of correcting them, Engineering Cybernetics 21 (1983) 15-26.
14. M. Kojima, N. Megiddo, S. Mizuno, A primal-dual infeasible-interior-point algorithm for linear programming, Mathematical Programming 61 (1993) 263-280.
15. I.J. Lustig, Feasibility issues in a primal-dual interior point method for linear programming, Mathematical Programming 49 (1990/91) 145-162.
16. I.J. Lustig, R.E. Marsten, D.F. Shanno, Computational experience with a primal-dual interior point method for linear programming, Linear Algebra and Its Applications 152 (1991) 191-222.
17. S. Mizuno, Polynomiality of infeasible-interior-point algorithms for linear programming, Mathematical Programming 67 (1994) 109-119.
18. F.A. Potra, An infeasible interior-point predictor-corrector algorithm for linear programming, SIAM Journal on Optimization 6 (1996) 19-32.
19. F.A. Potra, A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points, Mathematical Programming 67 (1994) 383-406.
20. Y. Ye, M.J. Todd, S. Mizuno, An O(√nL)-iteration homogeneous and self-dual linear programming algorithm, Mathematics of Operations Research 19 (1994) 52-67.
21. Y. Zhang, On the convergence of a class of infeasible interior-point methods for the horizontal linear complementarity problem, SIAM Journal on Optimization 4 (1994) 208-227.
22. A.J. Hoffman, On approximate solutions of systems of linear inequalities, Journal of Research of the National Bureau of Standards 49 (1952) 263-265.
23. O. Güler, A.J. Hoffman, U.G. Rothblum, Approximations to solutions to systems of linear inequalities, SIAM Journal on Matrix Analysis and Applications 16 (1995) 688-696.
24. p programming, European Journal of Operations Research 22 (1985) 70-100.
25. S. Mizuno, M.J. Todd, Y. Ye, On adaptive step primal-dual interior-point algorithms for linear programming, Mathematics of Operations Research 18 (1993) 964-981.
26. O. Güler, Y. Ye, Convergence behavior of interior-point algorithms, Mathematical Programming 60 (1993) 215-228.
27. X. Xu, P.-F. Hung, Y. Ye, A simplified homogeneous and self-dual linear programming algorithm and its implementation, Annals of Operations Research 62 (1996) 151-172.
28. M. Kojima, Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs, Annals of Operations Research 62 (1996) 1-28.
29. Y. Zhang, D. Zhang, On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithm, Mathematical Programming 68 (1995) 303-318.