A modification of conjugate gradient parameter and its global convergence for solving unconstrained optimization problems
DOI:
https://doi.org/10.32890/jcia2025.4.2.3Keywords:
conjugate gradient, global convergence, modified conjugate gradient coefficient, unconstrained optimization, Wolfe line searchAbstract
The methods of nonlinear conjugate gradient coefficients are significant and helpful in solving large-scale unconstrained optimization problems, due to their simplicity and lower storage requirement. Research activities on its applications to handle higher-dimensional systems of nonlinear equations are of paramount importance. Many authors studied and developed different kinds of conjugate gradient coefficients. Recently, some conjugate gradients were proposed with large dimensions, but they have small sample sizes. So, they cannot solve problems that have higher dimensions. Therefore, this research proposed a modified algorithm with a huge dimension and a large sample size. The strategy of strong Wolfe line search was applied in the convergence analysis, which makes it possible to converge globally with a descent property. Finally, the numerical results show that the proposed algorithm performs more efficiently and is superior to the existing Conjugate Gradient (CG) coefficients.
References
Abba, V. M., Mustafa, M., Waziri, M. Y., & Afendee, M. M. (2018). A new conjugate gradient with exact line search for unconstrained optimization. Far East Journal of Mathematical Sciences (FJMS), 105(2), 193–206. https://doi.org/10.17654/MS105020193
Abba, V. M., Mustafa, M., Waziri, M. Y., Afendee, M. M., & Usman, A. Y. (2018). A class of conjugate gradient parameters and its global convergence for solving unconstrained optimization. Far East Journal of Mathematical Sciences (FJMS), 106(1), 43–58. https://doi.org/10.17654/MS106010043
Andrei, N. (2008). ICI Technical Report 13/08. Research Institute for Informatics (ICI).
Dai, Y. H., & Yuan, Y. (2000). Nonlinear conjugate gradient methods. Shanghai Science and Technology Publisher.
Dolan, E. D., & Moré, J. J. (2002). Benchmarking optimization software with performance profiles. Mathematical Programming, 91(2), 201–213. https://doi.org/10.1007/s101070100263
Fletcher, R. (1987). Practical methods of optimization: Unconstrained optimization (Vol. 1). Wiley.
Fletcher, R., & Reeves, C. M. (1964). Function minimization by conjugate gradients. The Computer Journal, 7(2), 149–154. https://doi.org/10.1093/comjnl/7.2.149
Gilbert, J. C., & Nocedal, J. (1992). Global convergence properties of conjugate gradient methods for optimization. SIAM Journal on Optimization, 2(1), 21–42. https://doi.org/10.1137/0802003
Hager, W. W., & Zhang, H. (2005). A new conjugate gradient method with guaranteed descent and efficient line search. SIAM Journal on Optimization, 16(1), 170–192. https://doi.org/10.1137/030601880.
Hestenes, M. E., & Stiefel, E. (1952). Methods of conjugate gradients for solving linear systems. Journal of Research of the National Bureau of Standards, 49(6), 409–436. https://doi.org/10.6028/jres.049.044
Hillstrom, K. E. (1977). A simulation test approach to the evaluation of nonlinear optimization algorithms. ACM Transactions on Mathematical Software, 3(4), 305–315. https://doi.org/10.1145/355759.355760
Nocedal, J., & Wright, S. J. (1999). Numerical optimization. Springer. https://doi.org/10.1007/b98874
Lawal, M. (2016). On three conjugate gradient methods for solving nonlinear system of equations [Unpublished manuscript]. Department of Mathematical Sciences, Bayero University.
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/BF00940533
Mandara, A. V., Mamat, M., Waziri, M. Y., & Afendee, M. M. (2018). A modification of conjugate gradient method using strong Wolfe line search. International Journal of Engineering & Technology, 7(3.28), 163–167. https://doi.org/10.14419/ijet.v7i3.28.20984
Olowo, S. E., & Sulaiman, I. M. (2021). Performance analysis of a modified conjugate gradient algorithm for optimization models. IOP Conference Series: Materials Science and Engineering, 1115(1), 012004. https://doi.org/10.1088/1757-899X/1115/1/012004.
Polak, E., & Ribière, G. (1969). Note sur la convergence de méthodes de directions conjuguées. Revue Française d’Informatique et de Recherche Opérationnelle, 3(16), 35–43. https://doi.org/10.1051/m2an/196903R100351
Powell, M. J. D. (1984). Nonconvex minimization calculations and the conjugate gradient method. In D. F. Griffiths (Ed.), Numerical analysis (Lecture Notes in Mathematics, Vol. 1066, pp. 122–141). Springer. https://doi.org/10.1007/BFb0099521.
Powell, M. J. D. (1986). Convergence properties of algorithms for nonlinear optimization. SIAM Review, 28(4), 487–500. https://doi.org/10.1137/1028132
Rivaie, M., Fauzi, M., Mamat, M., & Ismail, M. (2012). A new class of conjugate gradient coefficient with global convergence properties. AIP Conference Proceedings, 1482(1), 486–490. https://doi.org/10.1063/1.4757519.
Rivaie, M., Mamat, M., & Abashar, A. (2015). A new class of nonlinear conjugate gradient coefficients with exact and inexact line searches. Applied Mathematics and Computation, 268, 1152–1163. https://doi.org/10.1016/j.amc.2015.06.115
Shi, Z. J., & Guo, J. (2009). Conjugate gradient method for nonlinear equations. Journal of Computational and Applied Mathematics, 224(2), 444–457. https://doi.org/10.1016/j.cam.2008.05.021
Sulaiman, I. M., Mamat, M., Abashar, A., Rivaie, M., Mohamad, F. S., & Saleh, Z. M. (2020). A new conjugate gradient method with descent properties and its application to regression analysis. Journal of Numerical Analysis, Industrial and Applied Mathematics, 14(3–4), 1–15.
Sun, J., & Zhang, J. (2001). Global convergence of conjugate gradient methods without line search. Annals of Operations Research, 103, 161–173. https://doi.org/10.1023/A:1012903105391.
Yakubu, U. A., Abdullahi, I., Murtala, S., & Mandara, A. V. (2020). Application of spectral PRP conjugate gradient parameter for unconstrained optimization problems. Malaysia Journal of Computing and Applied Mathematics, 3(2), 45–53. https://doi.org/10.37231/myjcam.2020.3.2.51.
Yakubu, U. A., Mamat, M., Afendee, M. M., Ghazali, P. L., & Rivaie, M. (2018). Secant condition for a spectral Hestenes conjugate gradient method and its sufficient descent properties. International Journal of Engineering & Technology, 7(3.28), 312–315. https://doi.org/10.14419/ijet.v7i3.28.21043
Yakubu, U. A., Mamat, M., Mandara, A. V., Iguda, A., Murtala, S., & Afendee, M. M. (2019). Decent condition for a scalar parameter on spectral HS (SPHS) conjugate gradient. International Journal of Recent Technology and Engineering, 8, 1–5.
Yakubu, U. A., Mandara, A. V., Abdullahi, I., & Kankarofi, R. H. (2023). Production maximization: A simplex method approach: A case study of Samfarera Rice Mills, Kano, Nigeria. Journal of Scientific Research, 2(2), 107–114.
Yakubu, U. A., Morch, M., & Saputra, P. A. (2022). Time series model analysis using autocorrelation function (ACF) and partial autocorrelation function (PACF) for e-wallet transactions during a pandemic. International Journal of Global Operations Research, 3(1), 11–20. https://doi.org/10.47194/ijgor.v3i1.111
Yuan, G., & Wei, Z. (2009). New line search methods for unconstrained optimization. Journal of the Korean Statistical Society, 38(1), 29–39. https://doi.org/10.1016/j.jkss.2008.05.004.
Yuan, G., & Wei, Z. (2010). Conjugate gradient of nonlinear problems. Journal of Software Engineering and Applications, 3(5), 503–509.
Yuan, Y., & Sun, W. (1999). Theory and methods of optimization. Science Press of China.
Zoutendijk, G. (1970). Nonlinear programming computational methods. In J. Abadie (Ed.), Integer and nonlinear programming (pp. 37–86). North-Holland.
Published
Issue
Section
License
Copyright (c) 2025 The Author(s)
This work is licensed under a Creative Commons Attribution 4.0 International License.
How to Cite
Research impact
Harvested 2026-09-06Counts differ between services because each indexes a different body of literature. None of them is the whole picture.
