✨
AI Summary & Key Takeaways
AI Insight⚡ TL;DR(Too Long; Didn't Read)
We presented some numerical result and comparison with Fletcher – Reeves algorithm.
📌 3 Key Takeaways
🎯
Objective & Hypothesis: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.
📊
Key Findings & Data:We prove the global convergent of these algorithms under Wolf line search conditions.
💡
Conclusion & Impact:We presented some numerical result and comparison with Fletcher – Reeves algorithm.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables: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.
Keywords
🔖
Cite This Article
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