Dai-Kou type conjugate gradient methods with a line search only using gradient

Journal of inequalities and applications

Yuanyuan Huang¹ 

关键词: conjugate gradient;    optimality condition;    line search;    sufficient descent condition;    global convergence;   

DOI  :  10.1186/s13660-017-1341-z

学科分类：数学（综合）

来源: SpringerOpen

【 摘 要 】

In this paper, the Dai-Kou type conjugate gradient methods are developed to solve the optimality condition of an unconstrained optimization, they only utilize gradient information and have broader application scope. Under suitable conditions, the developed methods are globally convergent. Numerical tests and comparisons with the PRP+ conjugate gradient method only using gradient show that the methods are efficient.

【 授权许可】

CC BY