Convergence of a modified SLP algorithm for the extended linear complementarity problem

2001 ◽  
Vol 22 (5) ◽  
pp. 602-608
Author(s):  
Xiu Nai-hua ◽  
Gao Zi-you
Keyword(s):  
Linear Complementarity Problem ◽  
Complementarity Problem ◽  
Linear Complementarity ◽  
Extended Linear Complementarity Problem ◽  
Modified Slp Algorithm

A globally convergent damped Gauss–Newton method for solving the extended linear complementarity problem

2015 ◽  
Vol 23 (3) ◽  
Author(s):  
Na Huang ◽  
Changfeng Ma
Keyword(s):  
Newton Method ◽  
Linear Complementarity Problem ◽  
Complementarity Problem ◽  
Complementarity Problems ◽  
Optimization Problems ◽  
Linear Complementarity Problems ◽  
Linear Complementarity ◽  
System Of Equations ◽  
Extended Linear Complementarity Problem ◽  
Special Cases

AbstractThe extended linear complementarity problem (denoted by XLCP), of which the linear and horizontal linear complementarity problems are two special cases, can be reformulated as the solution of a nonsmooth system of equations. By the symmetrically perturbed smoothing Fischer-Burmeister function, the XLCP is approximated by a family of parameterized smoothness optimization problems. Asmoothing damped Gauss-Newton method is designed for solving the XLCP. The proposed algorithm is proved to be convergent globally under suitable assumptions. Some numerical results are reported in the paper

Sign in / Sign up

Export Citation Format

Share Document