A New Conjugate Gradient Method for Solving Unconstrained Optimization Problems
Chen Zhong
Abstract
Chen Zhong
Abstract
In the ordinary circumstances,conjugate gradient method was an effective algorithm for solving large-scale restraint problems,different selections constructed different conjugate gradient methods.A new conjugate gradient method is proposed for solving unconstrained optimization problems to update and prove the method with Wolfe line search convergece globally.
OpenAlex reports 2 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 the ordinary circumstances,conjugate gradient method was an effective algorithm for solving large-scale restraint problems,different selections constructed different conjugate gradient methods.A new conjugate gradient method is proposed for solving unconstrained optimization problems to update and prove the method with Wolfe line search convergece globally.
Key concepts: Conjugate gradient method, Conjugate residual method, Derivation of the conjugate gradient method, Nonlinear conjugate gradient method, Gradient method, Biconjugate gradient method, Conjugate, Mathematical optimization