首页> 外文期刊>Applied mathematics and computation >Globally convergent Polak-Ribiere-Polyak conjugate gradient methods under a modified Wolfe line search
【24h】

Globally convergent Polak-Ribiere-Polyak conjugate gradient methods under a modified Wolfe line search

机译:改进的Wolfe线搜索下的全局收敛Polak-Ribiere-Polyak共轭梯度法

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

摘要

It is well known that global convergence has not been established for the Polak-Ribiere-Polyak (PRP) conjugate gradient method using the standard Wolfe conditions. In the convergence analysis of PRP method with Wolfe line search, the (sufficient) descent condition and the restriction beta(k) >= 0 are indispensable (see [4,7]). This paper shows that these restrictions could be relaxed. Under some suitable conditions, by using a modified Wolfe line search, global convergence results were established for the PRP method. Some special choices for beta(k) which can ensure the search direction's descent property were also discussed in this paper. Preliminary numerical results on a set of large-scale problems were reported to show that the PRP method's computational efficiency is encouraging.
机译:众所周知,尚未针对使用标准Wolfe条件的Polak-Ribiere-Polyak(PRP)共轭梯度法建立全局收敛。在采用Wolfe线搜索的PRP方法的收敛性分析中,下降条件(充分)和限制条件beta(k)> = 0是必不可少的(参见[4,7])。本文表明可以放宽这些限制。在某些合适的条件下,通过使用改进的Wolfe线搜索,可以建立PRP方法的全局收敛结果。本文还讨论了一些可以确保搜索方向的下降特性的beta(k)特殊选择。据报道,一系列大型问题的初步数值结果表明,PRP方法的计算效率令人鼓舞。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号