A Convergent Algorithm for Generalized Linear Complementarity Problem in Engineering Modeling

Abstract:

Article Preview

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.

Info:

Periodical:

Edited by:

Yanwen Wu

Pages:

205-210

DOI:

10.4028/www.scientific.net/AMR.267.205

Citation:

H. C. Sun "A Convergent Algorithm for Generalized Linear Complementarity Problem in Engineering Modeling", Advanced Materials Research, Vol. 267, pp. 205-210, 2011

Online since:

June 2011

Authors:

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.