返回
A three-step modulus-based iterative method for solving nonlinear complementarity problems
DOI:10.1007/s11075-025-02238-y.png)
摘要
En 中文
Complementarity problems are essential in various fields, including but not limited to scientific computing, engineering, operations research, and management science. In this paper, we introduce a novel three-step modulus-based matrix splitting (three-step MMS) method for solving nonlinear complementarity problems. The proposed method greatly speeds up convergence, reduces the number of required iterations, and minimizes error accumulation through spectral radius control. Through rigorous convergence analysis, we demonstrate the applicability and effectiveness of the three-step MMS method for H+-matrices under less restrictive conditions. The efficiency of the proposed method is confirmed by numerical experiments, and its performance is compared with existing methods, especially showing strong effectiveness for large-scale problems. The proposed method can save about 20% of the time compared with the two-step method. The results highlight its potential for both theoretical advancements and practical applications in solving complementarity problems.
Keyword:
Nonlinear complementarity problems
Matrix splitting
Convergence analysis
M-matrix
H+-matrix
期刊
N
IF:
2
论文数:
181
被引数:
5.5K
机构
引用论文
Modified modulus-based matrix splitting algorithms for a class of weakly nondifferentiable nonlinear complementarity problems基于改进模法的矩阵分裂算法在某一类弱非可微非线性互补问题中的应用
Accelerated modulus-based matrix splitting iteration method for a class of nonlinear complementarity problems一类非线性互补问题的加速模基矩阵分裂迭代法
On the choice of parameters in MAOR type splitting methods for the linear complementarity problem线性互补问题中MAOR型分裂方法的参数选择
The relaxation modulus-based matrix splitting iteration method for solving linear complementarity problems of positive definite matrices求解正定矩阵线性互补问题的松弛模矩阵分裂迭代法

