Ali, RashidAkgul, Ali2024-12-242024-12-2420240096-30031873-5649https://doi.org/10.1016/j.amc.2023.128378https://hdl.handle.net/20.500.12604/6349The linear complementarity problems (LCPs) can be encountered in various scientific computing, management science, and operations research. In this study, we introduce and analyze a new generalized accelerated overrelaxation (NGAOR) method for solving LCPs, in which one special case reduces to a new generalized successive overrelaxation (NGSOR) method. Moreover, we prove the convergence of the proposed methods when the system matrix is an H-matrix (irreducible or strictly diagonally dominant matrix). Numerical results for several experiments are present to show the effectiveness and efficiency of the proposed methods. AMS classification: 65F10, 90C33eninfo:eu-repo/semantics/closedAccessLinear complementarity problemsIteration methodsMatrix decompositionConvergenceH-matrixArticle464Q1WOS:001091601500001Q12-s2.0-8517362912010.1016/j.amc.2023.128378