@Article{JMS-48-1,
author = {Zeng , Min-Li and Zhang , Guo-Feng},
title = {Modulus-Based GSTS Iteration Method for Linear Complementarity Problems},
journal = {Journal of Mathematical Study},
year = {2015},
volume = {48},
number = {1},
pages = {1--17},
abstract = {<p style="text-align: justify;">In this paper, a modulus-based generalized skew-Hermitian triangular splitting
(MGSTS) iteration method is present for solving a class of linear complementarity
problems with the system matrix either being an $H_+$-matrix with non-positive
off-diagonal entries or a symmetric positive definite matrix. The convergence of the
MGSTS iteration method is studied in detail. By choosing different parameters, a series
of existing and new iterative methods are derived, including the modulus-based Jacobi
(MJ) and the modulus-based Gauss-Seidel (MGS) iteration methods and so on. Experimental
results are given to show the effectiveness and feasibility of the new method
when it is employed for solving this class of linear complementarity problems.</p>},
issn = {2617-8702},
doi = {https://doi.org/10.4208/jms.v48n1.15.01},
url = {http://global-sci.org/intro/article_detail/jms/9906.html}
}