We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Computer Science & Information Technology/New A hybrid Hestenes-Stiefel and Dai-Yuan conjugate gradient algorithms for unconstrained optimization
PeriodicalsComputer Science & Information Technology

New A hybrid Hestenes-Stiefel and Dai-Yuan conjugate gradient algorithms for unconstrained optimization

Checking your access to this record.

Abstract & Overview

In this Research we developed a New Hybrid method of conjugate gradient type, this Method depends basically on combining Hestenes-Stiefel and Dai-Yuan algorithms by using spectral direction conjugate algorithm, which is developed by Yang Z & Kairong W [19]. The developed method becomes converged by assuming some hypothesis. The numerical results show the efficiency of the developed method for solving test Unconstrained Nonlinear Optimization problems.

Cite this record

Khalil K. Abbo, Hisham M. Khudhur (2023). New A hybrid Hestenes-Stiefel and Dai-Yuan conjugate gradient algorithms for unconstrained optimization. Tikrit Journal of Pure Science, 21(1), 118–123. https://doi.org/10.25130/tjps.v21i1.961

Copy in another style

Abbo, K. K., & Khudhur, H. M. (2023). New A hybrid Hestenes-Stiefel and Dai-Yuan conjugate gradient algorithms for unconstrained optimization. Tikrit Journal of Pure Science, 21(1), 118–123. https://doi.org/10.25130/tjps.v21i1.961
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.