On the convergence of iterative methods for symmetric linear complementarity problems

1993 ◽  
Vol 59 (1-3) ◽  
pp. 33-48 ◽  
Author(s):  
Alfredo N. Iusem
2020 ◽  
Vol 54 (2) ◽  
pp. 341-349 ◽  
Author(s):  
Seyyed Ahmad Edalatpanah

This paper aims to propose the new preconditioning approaches for solving linear complementarity problem (LCP). Some years ago, the preconditioned projected iterative methods were presented for the solution of the LCP, and the convergence of these methods has been analyzed. However, most of these methods are not correct, and this is because the complementarity condition of the preconditioned LCP is not always equivalent to that of the un-preconditioned original LCP. To overcome this shortcoming, we present a new strategy with a new preconditioner that ensures the solution of the same problem is correct. We also study the convergence properties of the new preconditioned iterative method for solving LCP. Finally, the new approach is illustrated with the help of a numerical example.


2014 ◽  
Vol 2014 ◽  
pp. 1-6
Author(s):  
Cuiyu Liu ◽  
Chen-liang Li

The preconditioner presented by Hadjidimos et al. (2003) can improve on the convergence rate of the classical iterative methods to solve linear systems. In this paper, we extend this preconditioner to solve linear complementarity problems whose coefficient matrix isM-matrix orH-matrix and present a multisplitting and Schwarz method. The convergence theorems are given. The numerical experiments show that the methods are efficient.


Sign in / Sign up

Export Citation Format

Share Document