J4

• 数学 • 上一篇    下一篇

非精确条件下的谱共轭梯度算法

马明娟1,2, 邓 键1, 黄庆道1, 孙 瑶1   

  1. 1. 吉林大学 数学学院, 长春 130012; 2. 空军航空大学 基础部, 长春130022
  • 收稿日期:2008-06-03 修回日期:1900-01-01 出版日期:2009-03-26 发布日期:2009-03-26
  • 通讯作者: 黄庆道

Spectralconjugate Gradient Method with Inexact Line Search

MA Mingjuan1,2, DENG Jian1, HUANG Qingdao1, SUN Yao1   

  1. 1. College of Mathematics, Jilin University, Changchun 130012, China;2. Department of Foundation, Aviation University of Air Force, Changchun 130022, China
  • Received:2008-06-03 Revised:1900-01-01 Online:2009-03-26 Published:2009-03-26
  • Contact: HUANG Qingdao

摘要: 结合谱梯度算法的优点给出一类求解该问题的谱共轭梯度算法, 利用非精确线搜索确定步长, 避免了精确线搜索存在的不足. 给出了算法的收敛性证明, 并通过一些算例验证了算法的有效性和可行性.

关键词: 无约束最优化, 谱梯度, 共轭, 非精确线搜索

Abstract: On the basis of combining the advandage of spectralgradient method, a spectralconjugate gradient method for the global optimization is presented. This method can avoid the difficult caused by exact line search. The proof of the convergence of the proposed method is given. Numerical experiments show that the method is efficient and feasible.

Key words: unconstraint optimization, spectralgradient, conjugate, inexact line search

中图分类号: 

  • O221