A Hybrid Three-Term Conjugate Gradient Algorithm for Solving Unconstrained Optimization Problems
DOI:
10.33395/sinkron.v9i4.15339Keywords:
Conjugate Gradient, Descent Property, Unconstrained OptimizationAbstract
In this paper, we introduce a novel hybrid three-term conjugate gradient algorithm referred to as THREER, designed to address unconstrained optimization problems. The proposed approach integrates the -parameter introduced by Al-Neami with an additional third component derived from a rate-based vector , resulting in a search direction that preserves and enhances key characteristics of traditional conjugate gradient methods. A rigorous theoretical investigation establishes that the algorithm satisfies the sufficient descent condition regardless of the line search technique employed. Furthermore, the global convergence of the method is guaranteed under commonly accepted assumptions. Extensive numerical experiments conducted on large-scale benchmark problems reveal that THREER achieves superior performance when compared with several classical algorithms, particularly in terms of iteration count and function evaluations. These results highlight the algorithm’s robustness, efficiency, and potential for solving high-dimensional optimization tasks.
Downloads
References
Al-Naemi, G. M. (2022). The Convergent Properties of a New Parameter for Unconstrained Optimization. European Journal of Pure and Applied Mathematics, 15(4), 1683–1693. https://doi.org/10.29020/nybg.ejpam.v15i4.4538
Al-Namat, F. N., & Al-Naemi, G. M. (2020). Global Convergence Property with Inexact Line Search for a New Hybrid Conjugate Gradient Method. OALib, 07(02), 1–14. https://doi.org/10.4236/oalib.1106048
Andrei, N. (n.d.). New hybrid conjugate gradient algorithms for unconstrained optimization.
BEALE E. (1972). A derivation of conjugate-gradients. Numerical Methods for Non-Linear Optimization.
Cheng, W. (2007). A two-term PRP-based descent method. Numerical Functional Analysis and Optimization, 28(11–12), 1217–1230. https://doi.org/10.1080/01630560701749524
Control, N. A.-S. in I. and, & 2008, undefined. (n.d.). A hybrid conjugate gradient algorithm for unconstrained optimization as a convex combination of Hestenes-Stiefel and Dai-Yuan. Camo.Ici.RoN AndreiStudies in Informatics and Control, 2008•camo.Ici.Ro.
Dai, Y. H., & Yuan, Y. (1996). Convergence properties of the Fletcher-Reeves method. IMA Journal of Numerical Analysis, 16(2), 155–164. https://doi.org/10.1093/imanum/16.2.155
Deng, N., Software, Z. L.-O. M. and, & 1994, undefined. (1994). Global convergence of three terms conjugate gradient methods. Taylor & FrancisN Deng, Z LiOptimization Methods and Software, 1994•Taylor & Francis, 4(4), 273–282. https://doi.org/10.1080/10556789508805593
Dolan, E. D., & Moré, J. J. (2002). Benchmarking optimization software with performance profiles. Mathematical Programming, Series B, 91(2), 201–213. https://doi.org/10.1007/S101070100263
Faramarzi, P., & Amini, K. (2021). A spectral three-term Hestenes–Stiefel conjugate gradient method. 4or, 19(1), 71–92. https://doi.org/10.1007/s10288-020-00432-3
Fletcher, R. (1964). Function minimization by conjugate gradients. The Computer Journal, 7(2), 149–154. https://doi.org/10.1093/comjnl/7.2.149
Fletcher, R. (1987). Practical methods of optimization. In 2000.
G Zoutendijk, & . (1970). Nonlinear programming, computational methods. Nonlinear Programming Computational Methods, 37–86.
Hager, W. W. W. W., & Zhang, H. (2006). A Survey of Nonlinear Conjugate Gradient Methods. Pacific Journal of Optimization, 2(1), 35–58.
Hager, W. W., & Zhang, H. (2006). A new conjugate gradient method with guaranteed descent and an efficient line search. SIAM Journal on Optimization, 16(1), 170–192. https://doi.org/10.1137/030601880
Hassan, B. A., & Al-Naemi, G. M. (2020). A new quasi-newton equation on the gradient methods for optimization minimization problem. Indonesian Journal of Electrical Engineering and Computer Science, 19(2), 737–744. https://doi.org/10.11591/ijeecs.v19.i2.pp737-744
Hestenes, M. R., & Stiefel, E. (1952). Methods of conjugate gradients for solving linear systems. In Journal of Research of the National Bureau of Standards (Vol. 49, Issue 6, p. 409). https://doi.org/10.6028/jres.049.044
Liu, Y., & Storey, C. (1991). Efficient generalized conjugate gradient algorithms, part 1: Theory. Journal of Optimization Theory and Applications, 69(1), 129–137. https://doi.org/10.1007/BF00940464
Nazareth, L. (1977). A conjugate direction algorithm without line searches. Journal of Optimization Theory and Applications, 23(3), 373–387. https://doi.org/10.1007/BF00933447
Nocedal, J., & Wright, S. J. (2006). Numerical optimization. In Springer Series in Operations Research and Financial Engineering. https://doi.org/10.1201/b19115-11
Opérationnelle, R., Rouge, S. É., Olak, E. P., & Ibiere, G. R. (1969). R ’ . s.
Polyak, B. T. (1969). The conjugate gradient method in extremal problems. USSR Computational Mathematics and Mathematical Physics, 9(4), 94–112. https://doi.org/10.1016/0041-5553(69)90035-4
Yuan, Y., & Dai, Y. H. (1999). A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property. SIAM Journal on Optimization, 10(1), 177–182.
Zhang, J., Xiao, Y., & Wei, Z. (2009). Nonlinear conjugate gradient methods with sufficient descent condition for large-Scale unconstrained optimization. Mathematical Problems in Engineering, 2009. https://doi.org/10.1155/2009/243290
Zhang, X., & Yang, Y. (2024). A new hybrid conjugate gradient method close to the memoryless BFGS quasi-Newton method and its application in image restoration and machine learning. AIMS Mathematics, 9(10), 27535–27556. https://doi.org/10.3934/math.20241337
Downloads
|
How to Cite
Issue
Section
License
Copyright (c) 2025 Radhwan Basem Thanoon
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Google Scholar 
Moraref
PKP Index
Garuda Kemdikbud
Indonesia OneSearch
OCLC Worldcat
Dimensions
Index Copernicus
Scilit
Muhammad Khoiruddin harahap
