摘要
本文在著名PRP共轭梯度算法的基础上研究了一种无导数谱PRP投影算法,并证明了算法在求解带有凸约束条件的非线性单调方程组问题的全局收敛性.由于无导数和储存量小的特性,它更适应于求解大规模非光滑的非线性单调方程组问题.数值试验表明,新算法对给定的测试问题是有效的和稳定的.
In this paper, based on the famous PRP conjugate gradient method, a derivative-free spectral PRP projection method is proposed for solving nonlinear monotone equations with convex constraints. The global convergence of the proposed method is also established with some suitable conditions. Due to the derivative-free feature and lower storage requirement, the proposed method is very suitable to solve large-scale non-smooth nonlinear monotone equations. Numerical experiments show that the proposed method is efficient and robust.
出处
《计算数学》
CSCD
北大核心
2016年第2期113-124,共12页
Mathematica Numerica Sinica
基金
东南大学高校基本科研业务费专项资金
重庆市教委科学技术研究项目(KJ1501003)
重庆三峡学院重点项目(14ZD-14)
关键词
非线性单调方程组
投影算法
共轭梯度算法
全局收敛性
Nonlinear monotone equations
Projection method
Conjugate gradientmethod
Global convergence
