@Article{JCM-18-251,
author = {Qi , Huo-Duo and Zhang , Yu-Zhong},
title = {A Globally Derivative-Free Descent Method for Nonlinear Complementarity Problems},
journal = {Journal of Computational Mathematics},
year = {2000},
volume = {18},
number = {3},
pages = {251--264},
abstract = {<p style="text-align: justify;">Based on a class of functions, which generalize the squared Fischer-Burmeister NCP function and have many desirable properties as the latter function has, we reformulate nonlinear complementarity problem (NCP for short) as an equivalent unconstrained optimization problem, for which we propose a derivative-free descent method in monotone case. We show its global convergence under some mild conditions. If $F$, the function involved in NCP, is $R_0$-function, the optimization problems has bounded level sets. A local property of the merit function is discussed. Finally,we report some numerical results. &nbsp;</p>},
issn = {1991-7139},
doi = {https://doi.org/},
url = {http://global-sci.org/intro/article_detail/jcm/9039.html}
}