Convergence analysis of nonmonotone Levenberg–Marquardt algorithms for complementarity problem

This paper addresses the convergence of two nonmonotone Levenberg–Marquardt algorithms for nonlinear complementarity problem. Under some mild assumptions, and requiring only the solution of a linear system at each iteration, the nonmonotone Levenberg–Marquardt algorithms are shown to be globally convergent.