On superlinear convergence of infeasible interior-point algorithms for linearly constrained convex programs

Computational Optimization and Applications

Volumn 8, Issue 3, 1997, Pages 245-262

  Monteiro, Renato D C ^a   Zhou, Fangjun ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

Affine scaling; Convex program; Infeasible Interior Point algorithm; Superlinear convergence

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS;

INTERIOR POINT ALGORITHMS; SUPERLINEAR CONVERGENCE;

LINEAR PROGRAMMING;

EID: 0031281720     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008623505672     Document Type: Article

References (31)

1. C. C. Gonzaga and R. Tapia, On the convergence of the Mizuno-Todd-Ye algorithm to the analytic center of the solution set, SIAM J. Optim., 7, 1997, pp. 47-65.
2. M. Kojima, N. Megiddo and S. Mizuno, A primal-dual infeasible-interior-point algorithm for linear programming, Mathematical Programming, 61, 1993, pp. 263-280.
3. M. Kojima, N. Megiddo and T. Noma, Homotopy continuation methods for nonlinear complementarity problems, Mathematics of Operations Research, 16, 1991, pp. 754-774.
4. S. Mehrotra, Quadratic convergence in a primal-dual method, Mathematics of Operations Research, 18, 1993, pp. 741-751.
5. S. Mizuno, Polynomiality of infeasible-interior-point algorithms for linear programming, Mathematical Programming, 67, 1994, pp. 109-119.
6. R. D. C. Monteiro, T. Tsuchiya and Y. Wang, A Simplified Global Convergence Proof of the Affine Scaling Algorithm, Annals of Operations Research, 47, 1993, 443-482.
7. R. D. C. Monteiro and Y. Wang, Trust region affine scaling algorithms for linearly constrained convex and concave programs, Technical Report, School of ISyE, Georgia Institute of Technology, Atlanta, GA 30332, USA, June, 1995.
8. To appear in Mathematical Programming.
9. R. D. C. Monteiro and S. Wright, "A globally and superlinearly convergent potential reduction interior point method for convex programming, Technical Report, 92-13, Dept. of Systems and Industrial Engineering, University of Arizona, Tucson, AZ 85721, USA, July, 1992.
10. R. D. C. Monteiro and S. Wright, Local convergence of interior-point algorithms for degenerate monotone LCPs, Computational Optimization and Applications, 3, 1994, pp. 131-155.
11. R. D. C. Monteiro and S. Wright, Superlinear primal-dual affine scaling algorithms for LCP, Mathematical Programming, 69, 1995, pp. 311-333.
12. R. D. C. Monteiro and S. Wright, A superlinear infeasible-interior-point affine scaling algorithm for LCP, SIAM Journal on Optimization, 6, 1996, pp. 1-18.
13. F. A. Potra, An O(nL) infeasible-interior-point algorithm for LCP with quadratic convergence, Ann. of Oper. Res., 62, 1996, pp. 81-102.
14. F. A. Potra, A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points, Mathematical Programming, 67, 1994, pp. 383-406.
15. F. A. Potra and Y. Ye, Interior point methods for nonlinear complementarity problems, J. Optim. Theory Appl., 88, 1996, pp. 617-642.
16. F. A. Potra and Y. Ye, A quadratically convergent polynomial algorithm for solving entropy optimization problems, SIAM Journal on Optimization, 3, 1993, pp. 843-861.
17. E. M. Simantiraki and D. F. Shanno, An infeasible-interior-point method for linear complementarity problems, RUTCOR Research Report, RRR 7-95, Rutgers Center for Operations Research, Rutgers University, New Brunswick, NJ 08903, USA, 1995.
18. P. Tseng and Z. Q. Luo, On the convergence of the affine-scaling algorithm, Mathematical Programming, 56, 1992, pp. 301-319.
19. Tunçel, L., Constant potential primal-dual algorithms: A framework, Mathematical Programming, 66, 1994, pp. 145-159.
20. S. Wright, A path-following infeasible-interior-point algorithm for linear complementarity problems, Optimization Methods and Software, 2, 1993, pp. 79-106.
21. S. Wright, A path-following interior-point algorithm for linear and quadratic optimization problems, Ann. Oper. Res., 62, 1996, pp. 103-130.
22. S. Wright, An infeasible interior point algorithm for linear complementarity problems, Mathematical Programming, 67, 1994, 29-51.
23. S. Wright and D. Ralph, A superlinear infeasible-interior-point algorithm for monotone complementarity problems, Math. Oper. Res., 21, 1996, pp. 815-838.
24. Y. Ye, On the Q-order of convergence of interior-point algorithms for linear programming, in Proceedings of the 1992 Symposium on Applied Mathematics, F. Wu, ed., Institute of Applied Mathematics, Chinese Academy of Sciences, 1992, pp. 534-543.
25. Y. Ye and K. Anstreicher, On quadratic and O(√nL) convergence of a predictor-corrector algorithm for LCP, Mathematical Programming, 62, 1993, pp. 537-551.
26. Y. Ye, O. Güler, R. A. Tapia and Y. Zhang, A quadratically convergent O(√nL)-iteration algorithm for linear programming, Mathematical Programming, 59, 1993, pp. 151-162.
27. 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, pp. 208-227.
28. Y. Zhang and R. A. Tapia, Superlinear and quadratic convergence of primal-dual interior-point methods for linear programming revisited, Journal of Optimization Theory and Applications, 73, 1992, pp. 229-242.
29. Y. Zhang and R. A. Tapia, A superlinearly convergent polynomial primal-dual interior-point algorithm for linear programming, SIAM Journal on Optimization, 3, 1993, pp. 118-133.
30. Y. Zhang, R. A. Tapia and J. E. Dennis, On the superlinear and quadratic convergence of primal-dual interior point linear programming algorithms, SIAM Journal on Optimization, 2, 1992, pp. 304-324.
31. Y. Zhang and D. Zhang, On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms, Mathematical Programming, 68, 1995, pp. 303-318.