A smoothing Newton-type method for generalized nonlinear complementarity problem

Journal of Computational and Applied Mathematics

Volumn 212, Issue 1, 2008, Pages 75-85

  Zhang, Xinzhen ^a   Jiang, Hefeng ^b   Wang, Yiju ^a,c  

^a QUFU NORMAL UNIVERSITY   (China)

^b Taiyuan Teachers' College   (China)

^c HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

GNCP; Smoothing method; Superlinear convergence

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; FUNCTION EVALUATION; NONLINEAR EQUATIONS; PROBLEM SOLVING;

NONLINEAR COMPLEMENTARITY; POLYHEDRAL CONE; SMOOTHING METHOD; SUPERLINEAR CONVERGENCE;

NEWTON-RAPHSON METHOD;

EID: 36148941683     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cam.2006.03.042     Document Type: Article

References (18)

1. Andreani R., Friedlander A., and Santos S.A. On the resolution of the generalized nonlinear complementarity problem. SIAM J. Optim. 12 (2001) 303-321
2. Chen B.T., and Harker P.T. Smooth approximations to nonlinear complementarity problem. SIAM J. Optim. 7 2 (1997) 403-420
3. Chen X.J. Smoothing methods for complementarity problems and their applications: a survey. J. Oper. Res. Soc. Japan 43 1 (2000) 32-47
4. Clarke F.H. Optimization and Nonsmooth Analysis (1983), Wiley, New York, NY
5. Engelke S., and Kanzow C. On the solution of linear programs by Jacobian smoothing methods. Ann. Oper. Res. 103 (2001) 49-70
6. Facchinei F., and Pang J.S. Finite-dimensional Variational Inequalities and Complementarity Problems (2003), Springer, New York, NY
7. Facchinei F., and Soares J. A new merit function for nonlinear complementarity problems and a related algorithm. SIAM J. Optim. 7 (1997) 225-247
8. Fischer A. A special Newton-type optimization method. Optimization 24 (1992) 269-284
9. Jiang H., Fukushima M., Qi L., and Sun D. A trust region method for solving generalized complementarity problems. SIAM J. Optim. 8 (1998) 140-157
10. Kanzow C., and Fukushima M. Equivalence of the generalized complementarity problem to differentiable unconstrained minimization. J. Optim. Theory Appl. 90 (1996) 581-603
11. Kanzow C., and Pieper H. Jacobian smoothing methods for general nonlinear complementarity problems. SIAM J. Optim. 9 (1999) 342-372
12. Pang J.S., and Qi L. Nonsmooth equations: motivation and algorithms. SIAM J. Optim. 3 (1993) 443-465
13. Qi L. Convergence analysis of some algorithms for solving nonsmooth equations. Math. Oper. Res. 18 (1993) 227-244
14. Qi L., Sun D., and Zhou G.L. A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities. Math. Programming 87 1 (2000) 1-35
15. Qi L., and Sun J. A nonsmooth version of Newton's method. Math. Programming 58 (1993) 353-367
16. Qi L., and Zhou G.L. A smoothing Newton method for minimizing a sum of Euclidean norms. SIAM J. Optim. 11 2 (2000) 389-410
17. Tseng P., Yamashita N., and Fukushima M. Equivalence of complementarity problems to differentiable minimization: a unified approach. SIAM J. Optim. 6 (1996) 446-460
18. Wang Y.J., Ma F.M., and Zhang J.Z. A nonsmooth L-M method for solving the generalized nonlinear complementarity problem. Appl. Math. Optim. 52 (2005) 73-92