期刊名称：International Journal of Computer and Information Technology
印刷版ISSN：2279-0764
出版年度：2013
卷号：2
期号：4
页码：682
出版社：International Journal of Computer and Information Technology
摘要：In this paper, we consider the generalized linear complementarity problem (GLCP) over an affine subspace. To this end, we first reformulate the GLCP as a system of nonsmooth equation via the Fischer function. Based on this reformulation, the famous damped Gauss-Newton (DGN) algorithm is employed for obtaining its solution, and we show that the DGN algorithm is quadratically convergent without nondegenerate solution. Some numerical experiments of the algorithm are also reported in this paper
