A new family of conjugate gradient methods to solve unconstrained optimization problems
Basim A. Hassan, Zeyad M. Abdullah, Saif A. Hussein
Abstract
Basim A. Hassan, Zeyad M. Abdullah, Saif A. Hussein
Abstract
A conjugate optimal coefficient is a crucial characteristic of conjugate gradient algorithms. The idea of accelerating the conjugate gradient by utilizing the conjugacy condition information and quadratic model. The gradient of the objective function is used to specify the search directions for traditional techniques. This work provides nonlinear conjugate gradient algorithms that primarily consider objective function information. One of the ways is as efficient as or more efficient than the conventional methods, according to numerical examples.
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.
A conjugate optimal coefficient is a crucial characteristic of conjugate gradient algorithms. The idea of accelerating the conjugate gradient by utilizing the conjugacy condition information and quadratic model. The gradient of the objective function is used to specify the search directions for traditional techniques. This work provides nonlinear conjugate gradient algorithms that primarily consider objective function information. One of the ways is as efficient as or more efficient than the conventional methods, according to numerical examples.
Key concepts: Conjugate gradient method, Nonlinear conjugate gradient method, Derivation of the conjugate gradient method, Conjugate residual method, Gradient method, Conjugacy class, Conjugate, Mathematics