期刊文献+

New type of conjugate gradient algorithms for unconstrained optimization problems

New type of conjugate gradient algorithms for unconstrained optimization problems
下载PDF
导出
摘要 Two new formulaes of the main parameter βk of the conjugate gradient method are presented, which respectively can be seen as the modifications of method HS and PRP. In comparison with classic conjugate gradient methods, the new methods take both available gradient and function value information. Furthermore, their modifications are proposed. These methods are shown to be global convergent under some assumptions. Numerical results are also reported. Two new formulaes of the main parameter βk of the conjugate gradient method are presented, which respectively can be seen as the modifications of method HS and PRP. In comparison with classic conjugate gradient methods, the new methods take both available gradient and function value information. Furthermore, their modifications are proposed. These methods are shown to be global convergent under some assumptions. Numerical results are also reported.
出处 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2010年第6期1000-1007,共8页 系统工程与电子技术(英文版)
基金 supported by the Teaching and Research Award Program for the Outstanding Young Teachers in Higher Education Institutesof Ministry of Education the Natural Science Foundation of Inner Mongolia Autonomous Region (2010BS0108) SPH-IMU (Z20090135)
关键词 conjugate gradient unconstrained optimization global convergence conjugacy condition. conjugate gradient unconstrained optimization global convergence conjugacy condition.
  • 相关文献

参考文献1

二级参考文献2

共引文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部