首页> 外文会议>International Conference on Computational and Information Sciences >A Nonlinear Conjugate Gradient Method without Line Search and Its Global Convergence
【24h】

A Nonlinear Conjugate Gradient Method without Line Search and Its Global Convergence

机译:没有线搜索的非线性共轭梯度方法及其全球收敛

获取原文

摘要

Based on the method of Sun and Zhang (2001), we present a conjugate gradient method without line search. At each iteration, the step size is determined by a formula, which does not involve any matrix and uses both available function value and gradient information. Under mild assumptions, we prove that the proposed method has global convergence if the parameter is computed by five well-known formulae given by Feltcher-Reeves, Polak-Ribiere, Hestenses-Stiefel, Dai-Yuan and the conjugate descent method.
机译:基于Sun和Zhang(2001)的方法,我们提出了一种缀合格梯度法,没有线搜索。在每次迭代时,步长由公式确定,该公式不涉及任何矩阵并使用可用的功能值和梯度信息。在温和的假设下,我们证明,如果参数由Feltcher-Reeves,Polak-Ribiere,Hestenses-Stiefel,Dai-Yuan和共轭下降方法给出的五种公知的公式计算,则该方法具有全球收敛。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号