A new version of the Liu–Storey conjugate gradient method

作者：

Highlights：

•

摘要

In this paper, the global convergence of a new version of the Liu–Storey conjugate gradient method is discussed. This method combines the Liu–Storey conjugate gradient formula and a new inexact line search. We prove that the new method is globally convergent. Some preliminary numerical results show that the corresponding algorithm is efficient.

论文关键词：Conjugate gradient,Liu–Storey,Inexact line search,Nonconvex optimization,Global convergence

论文评审过程：Available online 12 January 2007.

论文官网地址：https://doi.org/10.1016/j.amc.2006.11.098