A Convergent Algorithm for Generalized Linear Complementarity Problem in Engineering Modeling
Keyword(s):
In this paper, we establish a error bound for the generalized linear complementtarity problem in engineering modeling(GLCP)which can be viewed as extensions of previously known results, based on which the famous Levenberg-Marquardt (L-M) algorithm is employed for obtaining its solution, and we show that the L-M algorithm is quadratically convergent without nondegenerate solution which is a new result for GLCP.
2009 ◽
Vol 142
(2)
◽
pp. 417-429
◽
2013 ◽
Vol 159
(1)
◽
pp. 93-107
◽
1995 ◽
Vol 223-224
◽
pp. 155-169
◽