Dergiler / Journal of Multidisciplinary Modeling and Optimization / 2026 / Cilt: 1 Sayı: 1

The new algorithm form of the Fletcher – Reeves Conjugate gradient algorithm

Sayfa
41–51
Yayın Tarihi
2018-08-01
DOI
—
🏛️Bu makalenin bibliyografik verileri ve tam metin bağlantısı DergiPark üzerinden sağlanmıştır.
DergiPark Kaydı ↗
✨

Yapay Zeka Hızlı Bakış & Çıkarımlar

AI Insight
⚡ TL;DR(1 Cümlede Hızlı Çıkarım)

We presented some numerical result and comparison with Fletcher – Reeves algorithm.

📌 3 Maddede Bu Makale

🎯
Amaç & Hipotez:In this paper, we propose a new spectral form of the Fletcher – Reeves conjugate gradient algorithm for solving unconstrained optimization problems which has sufficient descent direction.
📊
Temel Bulgular & Veri:We prove the global convergent of these algorithms under Wolf line search conditions.
💡
Sonuç & Katkı:We presented some numerical result and comparison with Fletcher – Reeves algorithm.
🔬Tür:Modelleme & Sayısal Simülasyon
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler:Conjugate gradient · Line search · Conjugate gradient

Abstract

In this paper, we propose a new spectral form of the Fletcher – Reeves conjugate gradient algorithm for solving unconstrained optimization problems which has sufficient descent direction. We prove the global convergent of these algorithms under Wolf line search conditions. We presented some numerical result and comparison with Fletcher – Reeves algorithm.

🔖

Bu Makaleye Atıf Yap

Hassan, B. A., Sadeq, H. M. (2018). The new algorithm form of the Fletcher – Reeves Conjugate gradient algorithm. Journal of Multidisciplinary Modeling and Optimization, Cilt: 1 Sayı: 1, 41–51. https://ajindex.com/articles/1593136

📄 Tam Metin PDF Okuyucu

📄

PDF görüntüleyici hazırlanıyor...

Kaynakça (14)

  1. Fletcher, R. (1989),' Practical Method of Optimization '(2nd Edition), (John Wiley and Sons, New York ).
  2. Polak, E. and Ribiere, G. (1969),' Note for Convergence Direction Conjugate ' Revue Francaise Informant, Reserche. Opertionelle, pp. 35-43.
  3. Hestenes, M. R. and Stiefel, E. L. (1952), ' Method of conjugate gradients for Solving linear systems ' Journal National Standards 49, pp. 409-436.
  4. Fletcher, R. and Reeves C. (1964),' Function minimization by conjugate gradients' Computer Journal 7, pp. 149-154.
  5. Zoutendijk, G. (1970), ' Nonlinear programming computational algorithms '. In: Integer and Nonlinear programming, Abadie, J. (ED). North-Holland, Amsterdam, ISBN: 044410008, PP. 37-86.
  6. Al-Baali, M. (1985), ' Descent property and global convergence of Flecher-Reeves with inexact line search '. IMA, J. Anal. 5, pp. 121-124.
  7. Dai, Y. and Yuan, Y. (1999),' A nonlinear conjugate gradient method with a strong global convergence property ' SIAM J. optimization 10, pp. 177-182.
  8. Birgin, E. and Martinez, J. M. (2001),' A spectral conjugate gradient method for unconstrained optimization ' App. Math. Optim. 43, pp. 117-128.
  9. Raydan, M. (1997),' The Barzilain and Borwein gradient method for the large unconstrained minimization problem ' SIAM J. Optim. 7, pp. 26-33.
  10. Li, Z., Weijun, Z. and Donghui, L. (2006),' Global convergence of a modified Fletcher Reeves conjugate gradient method with Armijo-type line ' pp. 561-572.
  11. Dai, Y. and Liao, Z. (2001),' New conjugate conditions and related nonlinear conjugate gradient methods ' Appl. Math. Optim. 43, pp. 87-101.
  12. Li, Z. (2009),' New versions of the Hestenes-Stiefel nonlinear conjugate gradient method based on the secant condition for optimization ' pp. 111-133.
  13. Zoutendijk, G. (1970), ' Nonlinear programming computational algorithms '. In: Integer and Nonlinear programming, Abadie, J. (ED). North-Holland, Amsterdam, ISBN: 044410008, PP. 37-86.
  14. Li, Z., Weijun, Z. and Donghui, L. (2006),' Global convergence of a modified Fletcher Reeves conjugate gradient method with Armijo-type line ' pp. 561-572.