Dai-Kou type conjugate gradient methods with a line search only using gradient
Yuanyuan Huang, Changhe Liu
Abstract
Open-access reader
Yuanyuan Huang, Changhe Liu
Abstract
Open-access reader
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.
OpenAlex reports 10 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Conjugate gradient method, Nonlinear conjugate gradient method, Derivation of the conjugate gradient method, Conjugate residual method, Mathematics, Gradient method, Biconjugate gradient method, Proximal Gradient Methods