Making use of a smoothing NCP-function, we formulate the generalized complementarity problem (GCP) over a polyhedral cone as an equivalent system of equations. Then we present a Newton-type method for the equivalent system to obtain a solution of the GCP. Our method solves only one linear system of equations and performs only one line search at each iteration. Under mild assumptions, we show that our method is both globally and superlinearly convergent. Compared to the previous literatures, our method has stronger convergence results under weaker conditions.
"A Superlinearly Convergent Method for the Generalized Complementarity Problem over a Polyhedral Cone." J. Appl. Math. 2013 1 - 6, 2013. https://doi.org/10.1155/2013/671402