The global linear and local quadratic convergence of a non-interior continuation algorithm for the LCP

IMA Journal of Numerical Analysis

Volumn 25, Issue 4, 2005, Pages 670-684

  Huang, Zheng Hai ^a  

^a TIANJIN UNIVERSITY   (China)

Author keywords

Global linear convergence; Local quadratic convergence; Non interior continuation method; P0 matrix linear complementarity problem

Indexed keywords

LINEAR SYSTEMS; MATRIX ALGEBRA;

CONTINUATION ALGORITHM; CONTINUATION METHOD; CONVERGENCE RESULTS; GLOBALLY CONVERGENT; LINEAR COMPLEMENTARITY PROBLEMS; LINEAR CONVERGENCE; LINEAR SYSTEM OF EQUATIONS; LOCAL QUADRATIC CONVERGENCE;

ITERATIVE METHODS;

EID: 26444554969     PISSN: 02724979     EISSN: 14643642     Source Type: Journal    
DOI: 10.1093/imanum/dri008     Document Type: Article

References (25)

1. BURKE, J. & Xu, S. (1998) The global linear convergence of a non-interior path-following algorithm for linear complementarity problems. Math. Oper. Res., 23, 719-734.
2. BURKE, J. & Xu, S. (1999) A non-interior predictor-corrector path-following algorithm for LCP. Reformulation: Nonsmooth, Piecewise Smooth and Smoothing Methods (M. Fukushima & L. Qi eds). Boston: Kluwer Academic Publishers, pp. 45-64.
3. BURKE, J. & Xu, S. (2000) A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem. Math. Progam., 87, 113-130.
4. 0 and monotone NCP. SIAM J. Optim., 9, 624-645.
5. CHEN, B. & HARKER, P. T. (1993) A non-interior-point continuation method for linear complementarity problems. SIAM J. Matrix Anal. Appl., 14, 1168-1190.
6. CHEN, B. & Xiu, N. (1999) A global linear and local quadratic non-interior continuation method for nonlinear complementarity problems based on Chen-Mangasarian smoothing functions. SIAM J. Optim., 9, 605-623.
7. ENGELKE, S. & KANZOW, C. (2000) Predictor-Corrector Smoothing Methods for the Solution of Linear Programming. Research Report, Department of Mathematics, University of Hamburg, Germany.
8. ENGELKE, S. & KANZOW, C. (2002) Improved smoothing-type methods for the solution of linear programming. Numer. Math., 90, 487-507.
9. HOTTA, K. & YOSHISE, A. (1999) Global convergence of a non-interior-point algorithms using Chen-Harker-Kanzow functions for nonlinear complementarity problems. Math. Program., 86, 105-133.
10. 0 function nonlinear complementarity problem. Oper. Res. Lett., 30, 202-210.
11. HUANG, Z. H. (2005) Locating a maximally complementary solution of the monotone NCP by using non-interior-point smoothing algorithms. Math. Meth. Oper. Res., 1, to appear.
12. HUANG, Z. H. & HAN, J. (2003) Non-interior continuation method for the monotone semidefinite complementarity problem. Appl. Math. Optim., 47, 195-211.
13. 0 function. J. Optim. Theory Appl., 117, 39-68.
14. 0- and monotone LCP. Math. Program., 99, 423-441.
15. KANZOW, C. (1996a) Global convergence properties of some iterative methods for linear complementarity problems. SIAM J. Optim., 6, 851-868.
16. KANZOW, C. (1996b) Some noninterior continuation methods for linear complementarity problems. SIAM J. Matrix Anal. Appl., 17, 851-868.
17. 0-functions. SIAM J. Optim., 10, 315-330.
18. QI, L. & SUN, D. (2000) Improving the convergence of non-interior point algorithms for nonlinear complementarity problems. Math. Comput., 69, 283-304.
19. SMALE, S. (1987) Algorithms for solving equations. Proceeding of the International Congress of Mathematicians (A. M. Gleason ed.). Providence, RI: American Mathematics Society, pp. 172-195.
20. TSENG, P. (1999) Analysis of a non-interior continuation method based on Chen-Mangasarian smoothing functions for complementarity problems. Reformulation - Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods (M. Fukushima & L. Qi eds). Boston: Kluwer Academic Publishers, pp. 381-404.
21. TSENG, P. (2000) Error bounds and superlinear convergence analysis of some Newton-type methods in optimization. Nonlinear Optimization and Related Topics (G. Di Pillo & F. Giannessi eds). Boston: Kluwer Academic Publishers, pp. 445-462.
22. XIU, N. (1999) One-step quadratic convergence of non-interior continuation method for NCP. Chinese Sci. Bull., 44, 1483-1488.
23. XU, S. (2000) The global linear convergence of an infeasible non-interior path-following algorithm for complementarity problems with uniform P-functions. Math. Program., 87, 501-517.
24. YAMASHITA, N. & FUKUSHIMA, M. (2001) On the rate of convergence of the Levenberg-Marquardt method. Computing [Suppl], 15, 227-238.
25. ZHAO, Y. B. & LI, D. (2001) Existence and limiting behavior of a non-interior-point trajectory for nonlinear complementarity problems without strict feasibility condition. SIAM J. Control Optim., 40, 898-924.