Smoothing Newton method for generalized complementarity problems based on a new smoothing function

In this paper, the generalized complementarity problem is studied. Based on a new smoothing function, the generalized complementarity problem is solved by a smoothing Newton-type algorithm. Under suitable conditions, we prove that the iteration sequence generated by the proposed smoothing method is bounded and the proposed algorithm is globally convergent. Some numerical results are reported.