Regularization semismooth Newton method for p0 NCPs with non monotone line search
Based on the generalized Fischer Burmeister function, Chen et al in 2008 put forward a regularization semismooth Newton method for solving the nonlinear complementarity problem with a P0 function. In this paper, we investigate the above algorithm with the monotone line search replaced by a non monotone line search. It is shown that the non monotone algorithm is well defined, and is globally and locally superlinearly convergent under standard assumptions.