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

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

Abstract 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. N...

Full description

Bibliographic Details
Main Authors: Yuanyuan Huang, Changhe Liu
Format: Article
Language:English
Published: SpringerOpen 2017-04-01
Series:Journal of Inequalities and Applications
Subjects:
conjugate gradient
optimality condition
line search
sufficient descent condition
global convergence
Online Access:http://link.springer.com/article/10.1186/s13660-017-1341-z

Internet

http://link.springer.com/article/10.1186/s13660-017-1341-z

Similar Items