An accelerated monotonic convergent algorithm for a class of non-Lipschitzian NCP(F) involving an M-matrix
An accelerated monotonic convergent algorithm for a class of non-Lipschitzian NCP(F) involving an M-matrix
复制标题
涉及 M 矩阵的一类非 Lipschitzian NCP(F) 的加速单调收敛算法
DOI：
10.1016/j.cam.2021.113624
复制
发表时间：
2021
影响因子：
2.4
通讯作者：
Wanquan Liu
中科院分区：
文献类型：
--
作者：
Xi Zhang;Wenling Zhao;Guanglu Zhou;Wanquan Liu
本文考虑一类由反应扩散问题产生的具有非Lipschitz函数的互补问题。对于这类互补问题，我们给出了一个单调迭代算法。该算法产生的序列是单调递减的，并收敛到互补问题的解。最后，数值结果表明所提出的算法的效率。
In this paper, we consider a class of complementarity problems with non-Lipschitzian functions arising from the reaction and diffusion problems. We develop a monotone iterative algorithm for this class of complementarity problems. The sequence generated by the proposed algorithm is monotonically decreasing and converges to the solution of the complementarity problems. Finally, numerical results are reported to demonstrate the efficiency of the proposed algorithm.