| 基于凸组合技术的加速FR型共轭梯度算法 |
| |
| 引用本文： | 李丹丹,王松华.基于凸组合技术的加速FR型共轭梯度算法[J].广西科学,2021,28(2):160-166. |
| |
| 作者姓名： | 李丹丹 王松华 |
| |
| 作者单位： | 广州华商学院应用数学系,广东广州 511300;百色学院数学与统计学院,广西百色 533000 |
| |
| 基金项目： | 广西自然科学基金项目（2018GXNSFAA281259，2020GXNSFAA159069）和广东财经大学华商学院校内项目（2020HSDS15）资助。 |
| |
| 摘 要： | 为高效求解非线性方程组问题,利用凸组合技术设计一个新型搜索方向,同时结合加速线搜索技术,提出一个新的加速FR型共轭梯度算法。在合理的假设下,新算法拥有全局收敛的良好性质。数值试验结果表明,新算法总体上优于经典FR算法和三项FR算法。新算法继承了修正FR方法的良好数值效果、充分下降性及信赖域特征,并具有计算简单和存储量小的特点。
|
| 关 键 词： | 非线性方程组 共轭梯度法 凸组合 充分下降性 全局收敛性 |
Accelerated FR Conjugate Gradient Algorithm Based on Convex Combination Technology |
| |
| LI Dandan,WANG Songhua.Accelerated FR Conjugate Gradient Algorithm Based on Convex Combination Technology[J].Guangxi Sciences,2021,28(2):160-166. |
| |
| Authors: | LI Dandan WANG Songhua |
| |
| Institution: | Department of Applied Mathematics, Guangzhou Huashang College, Guangzhou, Guangdong, 511300, China; School of Mathematics and Statistics, Baise University, Baise, Guangxi, 533000, China |
| |
| Abstract: | In order to solve the problem of nonlinear equations efficiently,a novel search direction is designed by using convex combination technology.Combined with accelerated line search technology,a new accelerated FR conjugate gradient algorithm is proposed. Under reasonable assumptions,the new algorithm has good properties of global convergence.The numerical results show that the new algorithm is generally superior to the classical FR algorithm and Three-term FR algorithm.The new algorithm inherits the good numerical effect,sufficient descent and trust region characteristics of the modified FR method,and has the characteristics of simple calculation and small storage. |
| |
| Keywords: | nonlinear equations conjugate gradient method convex combination sufficient descent trait global convergence |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《广西科学》浏览原始摘要信息 |
| 点击此处可从《广西科学》下载免费的PDF全文 |
|
