Solving Unconstrained Optimization Problem Using Hybrid CG Method with Exact Line Search
Article Sidebar
Main Article Content
Abstract: The conjugate gradient (CG) method is a one of the common approaches for solving unconstrained optimization problems, notably known for its suitability for large scale problems. Many recent studies show that this method is also useful for problems of smaller scale. One of the methods used for improving the performance of CG method is hybrid approach, where a CG method is combined with another method. In this study, the ARM CG method is combined with the SMR CG method and tested under exact line search. The resulting hybrid algorithm is globally convergent under exact line search and shown to perform well numerically in comparison to other tested CG methods.
Downloads
References
W. Sun & Y. X. Yuan (2006), Optimization Theory and Methods: Nonlinear Programming. New York: Springer Science and Business Media.
J. Jian, P. Liu, X. Jiang, & B. He (2022). Two improved nonlinear conjugate gradient methods with the strong Wolfe line search. Bulletin of the Iranian Mathematical Society, 48(5), 2297-2319.
Q. Jin, Q., R. Jiang, & A. Mokhtari, A. (2024). Non-asymptotic global convergence analysis of BFGS with the Armijo-Wolfe line search. Advances in Neural Information Processing Systems, 37, 16810-16851.
M. Rivaie, M. Mamat, L. W. June & I. Mohd (2012), A new class of nonlinear conjugate gradient coefficient with global convergence properties, Applied Mathematics and Computation, 218, pp. 11323-11332.
M. Rivaie, M. Mamat & A. Abashar (2015), A new class of nonlinear conjugate gradient coefficients with exact and inexact line searches, Applied Mathematics and Computation, 268, pp. 1152-1163.
Q. Jin, R. Jiang & A. Mokhtari (2025). Non-asymptotic global convergence rates of BFGS with exact line search. Math. Program.
N. H. Fadhilah, M. Rivaie, Ishak, F., & Idalisa, N. (2020). New Three-Term Conjugate Gradient Method with Exact Line Search. MATEMATIKA, 36(3), 197–207.
R. Fletcher & C. Reeves (1964), The Computer Journal 7, 149-154.
E. Polak & G. Ribiere (1969), Rev. Francaise Informat Recherche Operationelle 3, 35-43.
M. J. D. Powell (1984), Nonconvex Minimizations Calculations and the Conjugate Gradient Methods. Lecture Notes in Mathematics, 1066, Springer-Verlag, Berlin.
T. Diphofu, Kaelo & A.R. Tufa, (2023). A modified nonlinear conjugate gradient algorithm for unconstrained optimization and portfolio selection problems. RAIRO-Operations Research, 57(2), 817-835.
M. Awwal, I. M. Sulaiman, M. Malik, M. Mamat, P. Kumam & K. Sitthithakerngkiet (2021), A Spectral RMIL+ Conjugate Gradient Method for Unconstrained Optimization With Applications in Portfolio Selection and Motion Control, in IEEE Access, vol. 9, pp. 75398-75414.
M. Malik, I. M. Sulaiman, A. B. Abubakar, G. Ardaneswari, Sukono (2023). A new family of hybrid three-term conjugate gradient method for unconstrained optimization with application to image restoration and portfolio selection, AIMS Mathematics, 8(1)
N.‘Aini, N. Hajar, M. Rivaie, S. N. Ahmad, & A. A. Azamuddin, (2024). A hybrid of conjugate gradient method in modelling number of road accidents in Malaysia. In AIP Conference Proceedings (Vol. 3189, No. 1, p. 060002). AIP Publishing LLC.
N. S. Mohamed, M. Mamat, M. Rivaie, & S. M. Shaharudin, (2020). A new hyhbrid coefficient of conjugate gradient method, Indonesian Journal of Electrical Engineering and Computer Science, Vol. 18, No. 3
E. Dolan & J. J. More (2002). Mathematical Programming 91, 201-213
M. Jamil & X. S. Yang (2013), International Journal of Mathematical Modelling and Numerical Optimisation 4, 150–194.
This work is licensed under a Creative Commons Attribution 4.0 International License.
All articles published in our journal are licensed under CC-BY 4.0, which permits authors to retain copyright of their work. This license allows for unrestricted use, sharing, and reproduction of the articles, provided that proper credit is given to the original authors and the source.