Article ID: | iaor1998437 |
Country: | Netherlands |
Volume: | 75 |
Issue: | 3 |
Start Page Number: | 407 |
End Page Number: | 439 |
Publication Date: | Dec 1996 |
Journal: | Mathematical Programming |
Authors: | Facchinei Francisco, Kanzow Christian, Luca Tecla De |
Keywords: | Newton method, complementarity |
In this paper we present a new algorithm for the solution of nonlinear complementarity problems. The algorithm is based on a semismooth equation reformulation of the complementarity problems. We exploit the recent extension of Newton’s method to semismooth systems of equations and the fact that the natural merit function associated with the equation reformulation is continuously differentiable to develop an algorithm whose global and quadratic convergence properties can be established under very mild assumptions. Other interesting features of the new algorithm are an extreme simplicity along with a low computational burden per iteration. We include numerical tests which show the viability of the approach.