Some new conjugate gradient methods for solving unconstrained optimization problems
Basim A. Hassan, Zeyad M. Abdullah, Saif A. Hussein
Abstract
Basim A. Hassan, Zeyad M. Abdullah, Saif A. Hussein
Abstract
Conjugate gradient algorithms come in a wide range of flavors. Conjugate gradient techniques primarily concentrate on the coefficient conjugate. We introduce a novel conjugate gradient approach that computes the parameter by using Newton updates. In addition, we have demonstrated that our conjugate gradient algorithms are globally convergent and descent property. For the specified test issues in [1] the performance profiles revealed that the novel conjugate gradient approach is effective and efficient.
OpenAlex reports 1 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.
Conjugate gradient algorithms come in a wide range of flavors. Conjugate gradient techniques primarily concentrate on the coefficient conjugate. We introduce a novel conjugate gradient approach that computes the parameter by using Newton updates. In addition, we have demonstrated that our conjugate gradient algorithms are globally convergent and descent property. For the specified test issues in [1] the performance profiles revealed that the novel conjugate gradient approach is effective and efficient.
Key concepts: Conjugate gradient method, Conjugate, Conjugate residual method, Derivation of the conjugate gradient method, Nonlinear conjugate gradient method, Gradient descent, Biconjugate gradient method, Gradient method