Numer. Math. Theor. Meth. Appl., 5 (2012), pp. 186-204.
Published online: 2012-05
Cited by
- BibTex
- RIS
- TXT
In this paper, we propose a regularized version of the generalized NCP-function proposed by Hu, Huang and Chen [J. Comput. Appl. Math., 230 (2009), pp. 69-82]. Based on this regularized function, we propose a semismooth Newton method for solving nonlinear complementarity problems, where a non-monotone line search scheme is used. In particular, we show that the proposed non-monotone method is globally and locally superlinearly convergent under suitable assumptions. We test the proposed method by solving the test problems from MCPLIB. Numerical experiments indicate that this algorithm has better numerical performance in the case of $p=5$ and $\theta\in[0.25,075]$ than other cases.
}, issn = {2079-7338}, doi = {https://doi.org/10.4208/nmtma.2012.m10027}, url = {http://global-sci.org/intro/article_detail/nmtma/5934.html} }In this paper, we propose a regularized version of the generalized NCP-function proposed by Hu, Huang and Chen [J. Comput. Appl. Math., 230 (2009), pp. 69-82]. Based on this regularized function, we propose a semismooth Newton method for solving nonlinear complementarity problems, where a non-monotone line search scheme is used. In particular, we show that the proposed non-monotone method is globally and locally superlinearly convergent under suitable assumptions. We test the proposed method by solving the test problems from MCPLIB. Numerical experiments indicate that this algorithm has better numerical performance in the case of $p=5$ and $\theta\in[0.25,075]$ than other cases.