A New Spectral Conjugate Gradient Method for Nonlinear Unconstrained Optimization
Ibtisam A. Masmali1, Zabidin Salleh2 & Ahmad Alhawarat2 Show affiliations
- Jazan University, Saudi Arabia
- University Malaysia Terengganu, Malaysia
Journal of Computer Science, Volume 17, Issue 6, pp. 598–609 · doi.org/10.3844/jcssp.2021.598.609
Abstract
Theconjugate gradient method is widely used to solve large scale unconstrainedoptimization problems. However, the rate of convergence conjugate gradient method is linearunless it restarted. In this study, we present a new spectral conjugategradient modification formula with restart property obtains the globalconvergence and descent properties.In addition, we proposed a new restart condition for Fletcher-Reeves conjugate gradient formula. The numerical resultsdemonstrated that the modified Fletcher-Reeves parameter and the new CG formulawith their restart conditions are more efficient and robustness than otherconventional methods.
Licence and reuse
Open access. This article is licensed under a Creative Commons Attribution 4.0 International Licence (CC BY 4.0), as printed on the article, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original authors and the source. No permission is needed.
How to reuse this articleResponses (0)
About this article
Masmali, I. A., Salleh, Z. & Alhawarat, A. (2021). A New Spectral Conjugate Gradient Method for Nonlinear Unconstrained Optimization. Journal of Computer Science, 17(6), 598–609. https://doi.org/10.3844/jcssp.2021.598.609
- Licence
- CC BY 4.0
- Issue
- Volume 17, Issue 6
- Policies
- Editorial independenceUse of generative AIData availabilityAppeals and complaints
- Version
- Version of record
