求解非线性互补问题的松弛模系矩阵分裂算法  

A Relaxed Modulus-Based Matrix Splitting Method for Nonlinear Complementarity Problem

作　　者：谢水连[1] Xie Shuilia(School of Mathematics,Jiaying University,Meizhou 514015,China)

机构地区：[1]嘉应学院数学学院,广东梅州514015

出　　处：《宁夏大学学报（自然科学版）》2022年第4期325-329,共5页Journal of Ningxia University(Natural Science Edition)

基　　金：国家自然科学基金资助项目(11771157);广东省教育厅特色创新项目资助(2019KTSHTH72)。

摘　　要：讨论求解一类非线性互补问题的数值算法.通过引入松弛变量,首先将非线性互补问题转化为隐不动点方程.进一步提出了求解隐不动点方程的模系矩阵分裂算法.在适当的条件下,证明了算法的收敛性.初步的实验结果表明算法是可行且有效的.The numerical solution for a class of nonlinear complementarity problems(NCP)is discussed.By introducing a relaxation matrix,the NCF is first transformed into a hidden immovable point equation.Further,a relaxed modular matrix splitting method for NCP is proposed.Under appropriate conditions,the convergence of the algorithm is proved.Preliminary experimental results show that the algorithm is feasible and efficient.

关 键 词：非线性互补问题 模系矩阵分裂 收敛 

分 类 号：O224[理学—运筹学与控制论] O241[理学—数学]