scholarly journals An Interval Matrix Based Generalized Newton Method for Linear Complementarity Problems

2015 ◽  
Vol 05 (08) ◽  
pp. 443-449 ◽  
Author(s):  
Hai-Shan Han ◽  
Lan-Ying  
2014 ◽  
Vol 2014 ◽  
pp. 1-10
Author(s):  
Yuan Li ◽  
Hai-Shan Han ◽  
Dan-Dan Yang

We consider a class of absolute-value linear complementarity problems. We propose a new approximation reformulation of absolute value linear complementarity problems by using a nonlinear penalized equation. Based on this approximation reformulation, a penalized-equation-based generalized Newton method is proposed for solving the absolute value linear complementary problem. We show that the proposed method is globally and superlinearly convergent when the matrix of complementarity problems is positive definite and its singular values exceed 1. Numerical results show that our proposed method is very effective and efficient.


2015 ◽  
Vol 23 (3) ◽  
Author(s):  
Na Huang ◽  
Changfeng Ma

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