✨
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
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.
Anahtar kelimeler
🔖
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/836288