We consider a quadratic programming-based method for nonlinear complem
entarity problems which allows inexact solutions of the quadratic subp
roblems. The main features of this method are that all iterates stay i
n the feasible set and that the method has some strong global and loca
l convergence properties. Numerical results for all complementarity pr
oblems from the MCPLIB test problem collection are also reported. Math
ematics Subject Classification (1991): 65K05.