We establish the first rate of convergence result for the class of derivative-free descent methods for solving complementarity problems. The algorithm considered here is based on the implicit Lagrangian reformulation [26, 35] of the nonlinear complementarity problem, and makes use of the descent direction proposed in [42], but employs a different Armijo-type linesearch rule. We show that in the strongly monotone case, the iterates generated by the method converge globally at a linear rate to the solution of the problem.
['Olvi L. Mangasarian', 'Mikhail V. Solodov']
A Linearly Convergent Derivative-Free Descent Method for Strongly Monotone Complementarity Problems