DocumentCode
3264085
Title
A Smoothing Quadratically Convergent Algorithm for Generalized Linear Complementarity Problem in Engineering Modeling
Author
Sun, Hongchun
Author_Institution
Dept. of Math., Linyi Normal Univ. Linyi, Linyi, China
Volume
2
fYear
2009
fDate
6-7 June 2009
Firstpage
206
Lastpage
210
Abstract
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.
Keywords
convergence; matrix algebra; set theory; engineering modeling; generalized linear complementarity problem; smoothing quadratically convergent algorithm; Computational intelligence; Convergence of numerical methods; Estimation error; Jacobian matrices; Mathematical model; Mathematics; Operations research; Smoothing methods; Sun; Vectors; algorithm; engineering modeling; generalized Linear complementtarity problem; global error bound; globally convergent; quadratic rate of convergence;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Intelligence and Natural Computing, 2009. CINC '09. International Conference on
Conference_Location
Wuhan
Print_ISBN
978-0-7695-3645-3
Type
conf
DOI
10.1109/CINC.2009.133
Filename
5231004
Link To Document