Abstract

In this paper, we propose a new Levenberg–Marquardt algorithm for nonlinear complementarity problems. The algorithm is based on a semismooth equation reformulation of the complementarity problem using the FB function. To obtain the global convergence, we use a modified nonmonotone line search rule. Under the local error bound assumption, which is weaker than the nonsingularity condition, we get the local superlinear/quadratic convergence of the algorithm. Some numerical examples are given to illustrate the performance and efficiency of the presented algorithm.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.