A superlinearly convergent Newton-like algorithm for variational inequality problems with inequality constraints

In this paper, a Newton-like method for variational inequality problems is considered. One feature of the algorithm is that only the solution of linear systems of equations is required at each iteration and that the strict complementarity assumption is never invoked. Another is that under mild assumptions, the sequence produced by the Newton-like method Q-superlinearly converges to the solution of the VIP. Furthermore, a simpler version of this method is studied and it is shown that it is also superlinearly convergent. Manuscript received: June 1999 / Final version received: December 1999