A New Conjugate Gradient Method for Unconstrained Optimization Problems
Yongqiang He
Abstract
Yongqiang He
Abstract
In the ordinary circumstances,conjugate gradient method is the effective algorithm which solves the large-scale restraint question,different Selection of constructs different conjugate gradient method.We propose a new conjugate gradient method for unconstrained optimization problems by update and prove that method with wolf line search converges globally.
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.
In the ordinary circumstances,conjugate gradient method is the effective algorithm which solves the large-scale restraint question,different Selection of constructs different conjugate gradient method.We propose a new conjugate gradient method for unconstrained optimization problems by update and prove that method with wolf line search converges globally.
Key concepts: Conjugate gradient method, Conjugate residual method, Nonlinear conjugate gradient method, Conjugate, Derivation of the conjugate gradient method, Gradient method, Mathematical optimization, Computer science