Title :
A Smoothing Quadratically Convergent Algorithm for Generalized Linear Complementarity Problem in Engineering Modeling
Author_Institution :
Dept. of Math., Linyi Normal Univ. Linyi, Linyi, China
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;
Conference_Titel :
Computational Intelligence and Natural Computing, 2009. CINC '09. International Conference on
Conference_Location :
Wuhan
Print_ISBN :
978-0-7695-3645-3
DOI :
10.1109/CINC.2009.133
