scholarly journals The Modulus-Based Levenberg-Marquardt Method for Solving Linear Complementarity Problem

2019 ◽  
Vol 12 (1) ◽  
pp. 154-168
Author(s):  
Baohua Huang and Changfeng Ma
Keyword(s):  
Linear Complementarity Problem ◽  
Complementarity Problem ◽  
Linear Complementarity ◽  
Marquardt Method ◽  
Levenberg Marquardt

A Convergent Algorithm for Generalized Linear Complementarity Problem in Engineering Modeling

2011 ◽  
Vol 267 ◽  
pp. 205-210
Author(s):  
Hong Chun Sun
Keyword(s):  
Error Bound ◽  
Linear Complementarity Problem ◽  
Complementarity Problem ◽  
Linear Complementarity ◽  
Generalized Linear Complementarity Problem ◽  
Levenberg Marquardt ◽  
Engineering Modeling ◽  
Convergent Algorithm

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.

Sign in / Sign up

Export Citation Format

Share Document