A Newton-type algorithm for generalized linear complementarity problem over a polyhedral cone

In this paper, the generalized linear complementarity problem over a polyhedral cone (GLCP) is reformulated as an unconstrained optimization, based on which we propose a Newton-type algorithm to solve it. Under certain conditions, we show that the algorithm converges globally and quadratically. Preliminary numerical experiments are also reported in this paper.