scholarly journals Convergence of Iterates of an Inexact Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem

1991 ◽  
Vol 1 (1) ◽  
pp. 114-122 ◽  
Author(s):  
O. L. Mangasarian
Filomat ◽  
2020 ◽  
Vol 34 (7) ◽  
pp. 2171-2184
Author(s):  
Lu Jia ◽  
Xiang Wang ◽  
Xuan-Sheng Wang

The modulus-based matrix splitting iteration has received substantial attention as a momentous tool for complementarity problems. For the purpose of solving the horizontal linear complementarity problem, we introduce the two-step modulus-based matrix splitting iteration method. We also show the theoretical analysis of the convergence. Numerical experiments illustrate the effectiveness of the proposed approach.


Symmetry ◽  
2021 ◽  
Vol 13 (3) ◽  
pp. 503
Author(s):  
Shiliang Wu ◽  
Cuixia Li ◽  
Praveen Agarwal

In this paper, we obtain a new equivalent fixed-point form of the linear complementarity problem by introducing a relaxed matrix and establish a class of relaxed modulus-based matrix splitting iteration methods for solving the linear complementarity problem. Some sufficient conditions for guaranteeing the convergence of relaxed modulus-based matrix splitting iteration methods are presented. Numerical examples are offered to show the efficacy of the proposed methods.


Sign in / Sign up

Export Citation Format

Share Document