Abstract
We present a Q-quadratically convergent scaling Newton’s method for nonlinear complementarity problems. The sequence {(x
(k)
,y
(k)
)} generated by this algorithm keeps in . A t each iteration, the steplength is determined with at most 2n division operations