Asymptotic convergence in a generalized predictor-corrector method

Mathematical Programming, Series B

Volumn 74, Issue 1, 1996, Pages 11-28

  Mehrotra, Sanjay ^a  

^a Northwestern University   (United States)

Author keywords

Asymptotic convergence analysis; Linear programming; Predictor corrector methods; Primal dual methods

Indexed keywords

EID: 23844539926     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02592143     Document Type: Article

References (19)

1. A.J. Goldman and A.W. Tucker, Theory of linear programming, in: H.W. Kuhn and A.W. Tucker, eds., Linear Inequalities and Related Systems (Princeton University Press, Princeton, NJ, 1956) 53-97.
2. T.J. Carpenter, I.J. Lustig, J.M. Mulvey and D.F. Shanno, Higher order predictor-corrector interior point methods with applications to quadratic programming, Technical Report SOR 90-09, Department of Civil Engineering and Operations Research, Princeton University (Princeton, NJ, 1990).
3. M. Kojima, S. Mizuno and A. Yoshise, A polynomial-time algorithm for a class of linear complementarity problems, Mathematical Programming 44 (1989) 1-26.
4. I.J. Lustig, R.E. Marsten and D. F. Shanno, On implementing Mehrotra's predictor-corrector interior point method for linear programming, SIAM Journal on Optimization 2 (3) (1992) 435-449.
5. I.J. Lustig, R.E. Marsten and D.F. Shanno, Computational experience with a primal-dual interior point method for linear programming, Linear Algebra and Its Applications 152 (1989).
6. S. Mehrotra, On finding a vertex solution using interior point method, Linear Algebra and Its Applications 152 (1989) 233-253.
7. S. Mehrotra, On the implementation of a primal-dual interior point method, SIAM Journal on Optimization 2 (4) (1992) 575-601.
8. S. Mehrotra, Generalized predictor-corrector methods and their performance, Technical Report, Dept. of IE/MS, Northwestern University (Evanston, IL, 1991).
9. S. Mehrotra, Quadratic convergence in a primal-dual method, Mathematics of Operations Research 18 (3) (1991) 741-751.
10. S. Mehrotra and Y. Ye, Finding an interior point in the optimal face of linear programs, Mathematical Programming 62 (1993) 497-515.
11. S. Mizuno, M.J. Todd, and Y. Ye, On adaptive-step primal-dual interior-point algorithms for linear programming, Mathematics of Operations Research 18 (1993) 964-981.
12. R.C. Monteiro and I. Adler, Interior path following primal-dual algorithms. Part I: Linear programming, Mathematical Programming 44 (1989) 27-41.
13. J.M. Ortega and W.C. Rheinboldt, Iterative Solution of Nonlinear Equations in Several Variables (Academic Press, New York, 1990).
14. A. Schrijver, Theory of Linear and Integer Programming (Wiley, New York, 1986).
15. R. Tapia, Y. Zhang, M. Saltzman and A. Weiser, The predictor-corrector interior point method as a composite Newton method, Technical Report 90-06, Department of Mathematical Sciences, Rice University (Houston, TX, 1990).
16. M.J. Todd and Y. Ye, A centered projective algorithm for linear programming, Mathematics of Operations Research 15 (3) (1990) 508-529.
17. 3L) potential reduction algorithm for linear programming, Mathematical Programming 50 (2) (1988) 239-258.
18. Y. Ye, On the finite convergence of interior-point algorithms for linear programming, Mathematical Programming 57 (2) (1993) 325-336.
19. Y. Ye, O. Güler, R.A. Tapia and Y. Zhang, A quadratically convergent O(√nL)-iteration algorithm for linear programming, Mathematical Programming 59 (2) (1993) 151-162.