A new relaxed acceleration two-sweep modulus-based matrix splitting iteration method for solving linear complementarity problems-Reference-Cited by-同舟云学术

A new relaxed acceleration two-sweep modulus-based matrix splitting iteration method for solving linear complementarity problems

Published:2023 Issue:6 Volume:8 Page:13368-13389
ISSN:2473-6988
Container-title:AIMS Mathematics
language:
Short-container-title:MATH

Author:

Yu Dongmei¹,Zhang Yiming¹,Chen Cairong²,Han Deren³

Affiliation:

1. Institute for Optimization and Decision Analytics, Liaoning Technical University, Fuxin 123000, China

2. School of Mathematics and Statistics, FJKLMAA and Center for Applied Mathematics of Fujian Province, Fujian Normal University, Fuzhou 350007, China

3. LMIB of the Ministry of Education, School of Mathematical Sciences, Beihang University, Beijing 100191, China

Abstract

<abstract><p>A new relaxed acceleration two-sweep modulus-based matrix splitting (NRATMMS) iteration method is developed to solve linear complementarity problems. The convergence of the NRATMMS method is established with the system matrix $ A $ being an $ H_{+} $-matrix. Numerical experiments show that the proposed method is superior to some existing algorithms under appropriate conditions.</p></abstract>

Publisher

American Institute of Mathematical Sciences (AIMS)

Subject

General Mathematics

Reference50 articles.

1. R. W. Cottle, J. S. Pang, R. E. Stone, The linear complementarity problem, San Diego: Academic Press, 1992. http://doi.org/10.1137/1.9780898719000

2. K. G. Murty, Linear complementarity, linear and nonlinear programming, Berlin: Heldermann, 1988.

3. U. Schäfer, A linear complementarity problem with a $P$-matrix, SIAM Rev., 46 (2004), 189–201. http://dx.doi.org/10.1137/S0036144502420083

4. N. W. Kappel, L. T. Watson, Iterative algorithms for the linear complementarity problem, Int. J. Comput. Math., 19 (1986), 273–297. http://dx.doi.org/10.1080/00207168608803522

5. Z. Z. Bai, On the monotone convergence of the projected iteration methods for linear complementarity problem, Numer. Math. J. Chinese Univ. (English Ser.), 5 (1996), 228–233.

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Accelerated Relaxation Two-Sweep Modulus-Based Matrix Splitting Iteration Method for Linear Complementarity Problems;International Journal of Computational Methods;2023-09-26