一个新的无约束最优化的共轭梯度算法 |
| |
引用本文: | 刘海林.一个新的无约束最优化的共轭梯度算法[J].广东技术师范学院学报,1998(4). |
| |
作者姓名: | 刘海林 |
| |
作者单位: | 广东民族学院计算机科学系!广州,510633 |
| |
摘 要: | 对于无约束最优化问题,本文基于局部收敛的Polak-Ribiere方法和全局收敛的Fletcher-Reeves方法,提出了一个新的共轭梯度算法,并采用精确线性搜索方法,得到了全局收敛的好性质。
|
关 键 词: | 无约束最优化 共轭梯度算法 线性搜索 全局收敛 |
A New Conjugate Gradient Algorthm for Unconstrained Optimization |
| |
Institution: | (Liu Hailin,Department of Computer Science,Guangdong Institute for Nationalities) |
| |
Abstract: | In This Paper, I Have Presented A New Algorithm, Based on Polak-Ribiere Algorithm with Local Convergence and Fletcher-Reeves Algorithm with Globally Convergence.In Our Algorithm, Acurite Line Search Be Needed. It is Proved That the New Algorthm is Globally Convergent. |
| |
Keywords: | Unconstrained Optimization Conjugate Gradient Algorithm Line search Globally Convergence |
本文献已被 CNKI 等数据库收录! |