Using a new coefficient conjugate gradient method for solving unconstrained optimization problems

Ranen M. Sulaiman, Basim A. Hassan

Abstract


The conjugate gradient technique is a numerical solution strategy for finding minimization in mathematics. We present a simple, straightforward, efficient, and resilient conjugate gradient technique in this study. To address the convergence difficulty and descent property, the new technique is built on the quadratic model. Under some assumptions, the new improved approach meets the convergence characteristics and the adequate descent criterion. The suggested unique strategy is substantially more efficient than the classic FR method, according to our numerical analysis. The number of function evaluations, iterations and restarts are all included in the numerical results. The computational efficiency of the proposed approach is proved by comparative results.

Keywords


Conjugate gradient; Descent property; Global converg-ence; Numerical results; Optimization

Full Text:

PDF


DOI: http://doi.org/10.11591/ijeecs.v27.i3.pp1642-1648

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

shopify stats IJEECS visitor statistics