Volume 21, Issue 1 (4-2026)
IJMSI 2026, 21(1): 67-84 |
Back to browse issues page
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
Deepho J, Abubakar A B, Malik M, Ibrahim A H, Kiri A I. An Efficient FR-CD-Like Algorithm for Unconstrained Optimization. IJMSI 2026; 21 (1) :67-84
URL: http://ijmsi.ir/article-1-2124-en.html
URL: http://ijmsi.ir/article-1-2124-en.html
Jitsupa Deepho 
, Auwal Bala Abubakar , Maulana Malik , Abdulkarim Hassan Ibrahim , Aliyu Ibrahim Kiri
, Auwal Bala Abubakar , Maulana Malik , Abdulkarim Hassan Ibrahim , Aliyu Ibrahim Kiri
Abstract:
A hybrid conjugate gradient (CG) method is proposed for solving unconstrained optimization problems. The direction of the method is a combination of a three-term conjugate descent (CD) and Fletcher-Reeves (FR) CG directions. Also, it is close to the direction of the memoryless Broyden-Fletcher-Goldfarb-Shanno (BFGS) method. In addition, under the Wolfe-type line search, the global convergence of the method is established. Numerical experiments are conducted on some benchmark test problems and the results are reported to show the efficiency of the propose method compared with some existing methods.
Type of Study: Research paper |
Subject:
General
References
1. A. B. Abubakar, P. Kumam, M. Malik, P. Chaipunya, A. H. Ibrahim, A Hybrid FRDY Conjugate Gradient Algorithm for Unconstrained Optimization with Application in Portfolio Selection, AIMS Mathematics, 6(6), (2021), 6506-6527.
2. A. B. Abubakar, P. Kumam, M. Malik, and A. H. Ibrahim, A Hybrid Conjugate Gradient Based Approach for Solving Unconstrained Optimization and Motion Control Problems, Mathematics and Computers in Simulation, 201, (2022), 640-657. [DOI:10.1016/j.matcom.2021.05.038]
3. M. Al-Baali, Descent Property and Global Convergence of the Fletcher-Reeves Method with Inexact Line Search, IMA Journal of Numerical Analysis, 5(1), (1985), 121-124. [DOI:10.1093/imanum/5.1.121]
4. N. Andrei, Nonlinear Conjugate Gradient Methods for Unconstrained Optimization, Springer, 2020. [DOI:10.1007/978-3-030-42950-8]
5. N. Andrei, A Simple Three-Term Conjugate Gradient Algorithm for Unconstrained Optimization, Journal of Computational and Applied Mathematics, 241, (2013), 19-29. [DOI:10.1016/j.cam.2012.10.002]
6. Y. H. Dai, J. Han, G. Liu, D. Sun, H. Yin, Y. X. Yuan, Convergence Properties of Nonlinear Conjugate Gradient Methods, SIAM Journal on Optimization, 10(2), (2000), 345-358. [DOI:10.1137/S1052623494268443]
7. J. Deepho, A. B. Abubakar, M. Malik, I. K. Argyros, Solving Unconstrained Optimization Problems via Hybrid CD-DY Conjugate Gradient Methods with Applications, Journal of Computational and Applied Mathematics, 405, (2022), 113823. [DOI:10.1016/j.cam.2021.113823]
8. E. D. Dolan, J. J. Mor'e, Benchmarking Optimization Software with Performance Profiles, Mathematical Programming, 91(2), (2002), 201-213. [DOI:10.1007/s101070100263]
9. R. Fletcher, Practical Methods of Optimization, John Wiley & Sons, 2013.
10. R. Fletcher, C. M. Reeves, Function Minimization by Conjugate Gradients, The Computer Journal, 7(2), 1964, 149-154. [DOI:10.1093/comjnl/7.2.149]
11. J. C. Gilbert, J. Nocedal, Global Convergence Properties of Conjugate Gradient Methods for Optimization, SIAM Journal on Optimization, 2(1), 1992, 21-42. [DOI:10.1137/0802003]
12. W. Hager, H. Zhang, A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search, SIAM Journal on Optimization, 16(1), (2005), 170-192. [DOI:10.1137/030601880]
13. W. Hager, H. Zhang, Algorithm 851: CG-Descent, a Conjugate Gradient Method with Guaranteed Descent, ACM Transactions on Mathematical Software (TOMS), 32(1), (2006), 113-137. [DOI:10.1145/1132973.1132979]
14. W. Hager, H. Zhang, A Survey of Nonlinear Conjugate Gradient Methods, Pacific journal of Optimization, 2(1), (2006), 35-58.
15. M. R. Hestenes, E. Stiefel, Methods of Conjugate Gradients for Solving Linear Systems, Journal of Research of the National Bureau of Standards, 49(6), (1952), 409-436. [DOI:10.6028/jres.049.044]
16. M. Jamil, X. S. Yang, A Literature Survey of Benchmark Functions for Global Optimisation problems, International Journal of Mathematical Modelling and Numerical Optimisation, 4(2), (2013), 150-194. [DOI:10.1504/IJMMNO.2013.055204]
17. M. Li, A Modified Hestense-Stiefel Conjugate Gradient Method Close to the Memoryless BFGS quasi-Newton Method, Optimization Methods and Software, 33(2), (2018), 336-353. [DOI:10.1080/10556788.2017.1325885]
18. M. Li, A Three Term Polak-Ribi'ere-Polyak Conjugate Gradient Method Close to the Memoryless BFGS quasi-Newton Method, Journal of Industrial & Management Optimization, 16(1), (2020), 245. [DOI:10.3934/jimo.2018149]
19. J. Liu, Y. M. Feng, L. M. Zou, Some Three-Term Conjugate Gradient Methods with the Inexact Line Search Condition, Calcolo, 55(2), (2018), 1-16. [DOI:10.1007/s10092-018-0258-3]
20. J. Liu, S. J. Li, New Hybrid Conjugate Gradient Method for Unconstrained Optimization, Applied Mathematics and Computation, 245, (2014), 36-43. [DOI:10.1016/j.amc.2014.07.096]
21. J. Nocedal, Updating quasi-Newton Matrices with Limited Storage, Mathematics of Computation, 35(151), (1980), 773-782. [DOI:10.1090/S0025-5718-1980-0572855-7]
22. D. F. Shanno, Conjugate Gradient Methods with Inexact Searches, Mathematics of Operations Research, 3(3), (1978), 244-256. [DOI:10.1287/moor.3.3.244]
23. W. Sun, Y. X. Yuan, Optimization Theory and Methods: Nonlinear Programming. Springer, 2006.
24. L. Zhang, W. Zhou, D. H. Li, A Descent Modified Polak-Ribi'ere-Polyak Conjugate Gradient Method and its Global Convergence, IMA Journal of Numerical Analysis, 26(4), (2006), 629-640. [DOI:10.1093/imanum/drl016]
| Rights and permissions | |
 |
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License. |
