首页> 外文期刊>Journal of Computational and Applied Mathematics >Conjugate gradient methods based on secant conditions that generate descent search directions for unconstrained optimization
【24h】

Conjugate gradient methods based on secant conditions that generate descent search directions for unconstrained optimization

机译:基于割线条件的共轭梯度方法,可生成下降搜索方向进行无约束优化

获取原文
获取原文并翻译 | 示例
           

摘要

Conjugate gradient methods have been paid attention to, because they can be directly applied to large-scale unconstrained optimization problems. In order to incorporate second order information of the objective function into conjugate gradient methods, Dai and Liao (2001) proposed a conjugate gradient method based on the secant condition. However, their method does not necessarily generate a descent search direction. On the other hand, Hager and Zhang (2005) proposed another conjugate gradient method which always generates a descent search direction. In this paper, combining Dai-Liao's idea and Hager-Zhang's idea, we propose conjugate gradient methods based on secant conditions that generate descent search directions. In addition, we prove global convergence properties of the proposed methods. Finally, preliminary numerical results are given.
机译:共轭梯度法已得到关注,因为它们可以直接应用于大规模无约束优化问题。为了将目标函数的二阶信息纳入共轭梯度法,Dai and Liao(2001)提出了一种基于割线条件的共轭梯度法。但是,他们的方法不一定生成下降搜索方向。另一方面,Hager和Zhang(2005)提出了另一种共轭梯度方法,该方法总是生成下降搜索方向。本文结合戴辽的思想和Hager-Zhang的思想,提出了基于割线条件的共轭梯度法,该方法产生了下降搜索方向。另外,我们证明了所提出方法的全局收敛性。最后,给出了初步的数值结果。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号