A Smoothing Quadratically Convergent Algorithm for Generalized Linear Complementarity Problem in Engineering Modeling

In this paper, we establish a global error bound for the generalized linear complementarity problem in engineering modeling (GLCP), based on we propose a new type of solution method to solve the GLCP. The global and quadratic rate of convergence is established without nondegenerate solution. These conclusions can be viewed as extensions of previously known results.