A class of conjugate gradient methods for unconstrained optimization
LI An-kun
Abstract
LI An-kun
Abstract
Conjugate gradient method is a method for solving nonlinear optimization problems,especially large-scale problems.A new nonlinear conjugate gradient formula is presented in this paper.This method with the proposed formula and an inexact line search of Wolfe conditions are used is global convergence.Some numerical tests have been made and the results show that the algorithm is effective.
A significance statement is not available in the OpenAlex record.
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.
Conjugate gradient method is a method for solving nonlinear optimization problems,especially large-scale problems.A new nonlinear conjugate gradient formula is presented in this paper.This method with the proposed formula and an inexact line search of Wolfe conditions are used is global convergence.Some numerical tests have been made and the results show that the algorithm is effective.
Key concepts: Nonlinear conjugate gradient method, Conjugate gradient method, Derivation of the conjugate gradient method, Conjugate residual method, Gradient method, Convergence (economics), Mathematics, Biconjugate gradient method