Communications on Applied Mathematics and Computation ›› 2025, Vol. 7 ›› Issue (5): 1617-1638.doi: 10.1007/s42967-023-00354-x

• ORIGINAL PAPERS • Previous Articles    

Convergence Analysis of the Projected SOR Iteration Method for Horizontal Linear Complementarity Problems

Qin-Qin Shen1, Geng-Chen Yang2, Chen-Can Zhou1   

  1. 1. School of Transportation and Civil Engineering, Nantong University, Nantong, 226019, Jiangsu, China;
    2. School of Science, Nantong University, Nantong, 226019, Jiangsu, China
  • Received:2023-08-18 Revised:2023-11-21 Accepted:2023-11-24 Online:2024-05-07 Published:2024-05-07
  • Contact: Chen-Can Zhou,E-mail:zhouchencan@ntu.edu.cn E-mail:zhouchencan@ntu.edu.cn
  • Supported by:
    This work was supported by the National Natural Science Foundation of China (No. 11771225) and the Qinglan Project of Jiangsu Province of China.

Abstract: Recently, the projected Jacobi (PJ) and projected Gauss-Seidel (PGS) iteration methods have been studied for solving the horizontal linear complementarity problems (HLCPs). To further improve the convergence rates of the PJ and PGS iteration methods, by using the successive overrelaxation (SOR) matrix splitting technique, a projected SOR iteration method is introduced in this paper to solve the HLCP. Convergence analyses are carefully studied when the system matrices are strictly diagonally dominant and irreducibly diagonally dominant. The newly obtained convergence results greatly extend the current convergence theory. Finally, two numerical examples are given to show the effectiveness of the proposed PSOR iteration method and its advantages over the recently proposed PJ and PGS iteration methods.

Key words: Horizontal linear complementarity problem (HLCP), Matrix splitting, Projected method, Successive overrelaxation (SOR) iteration, Convergence