A new type of solution method for the generalized linear complementarity problem over a polyhedral cone.

This paper addresses the generalized linear complementarity problem (GLCP) over a polyhedral cone. To solve the problem, we first equivalently convert the problem into an affine variational inequalities problem over a closed polyhedral cone, and then propose a new type of method to solve the GLCP based on the error bound estimation. The global and R-linear convergence rate is established. The numerical experiments show the efficiency of the method. [ABSTRACT FROM AUTHOR]