共轭梯度法
数学
非线性系统
图像(数学)
数学分析
非线性共轭梯度法
类型(生物学)
应用数学
印度
信号(编程语言)
结合
共轭残差法
算法
人工智能
计算机科学
梯度下降
物理
生物
量子力学
人工神经网络
中国
程序设计语言
法学
生态学
政治学
作者
Kabiru Ahmed,Mohammed Yusuf Waziri,Abubakar Sani Halilu,Salisu Murtala,Habibu Abdullahi
摘要
Abstract The one parameter conjugate gradient method by Hager and Zhang ( Pac J Optim , 2 (1):35–58, 2006) represents a family of descent iterative methods for solving large‐scale minimization problems. The nonnegative parameter of the scheme determines the weight of conjugacy and descent, and by extension, the numerical performance of the method. The scheme, however, does not converge globally for general nonlinear functions, and when the parameter approaches 0, the scheme reduces to the conjugate gradient method by Hestenes and Stiefel ( J Res Nat Bur Stand , 49 :409–436, 1952), which in practical sense does not perform well due to the jamming phenomenon. By carrying out eigenvalue analysis of an adaptive two parameter Hager–Zhang type method, a new scheme is presented for system of monotone nonlinear equations with its application in compressed sensing. The proposed scheme was inspired by nice attributes of the Hager–Zhang method and the various schemes designed with double parameters. The scheme is also applicable to nonsmooth nonlinear problems. Using fundamental assumptions, analysis of the global convergence of the scheme is conducted and preliminary report of numerical experiments carried out with the scheme and some recent methods indicate that the scheme is promising.
科研通智能强力驱动
Strongly Powered by AbleSci AI