A Sufficient Descent 3-Term Conjugate Gradient Method for Unconstrained Optimization Algorithm
Article Sidebar
Main Article Content
Abstract
In recent years, 3-term conjugate gradient algorithms (TT-CG) have sparked interest for large scale unconstrained optimization algorithms due to appealing practical factors, such as simple computation, low memory requirement, better sufficient descent property, and strong global convergence property. In this study, minor changes were made to the BRB-CG method used for addressing the optimization algorithms discussed. Then, a new 3-term BRB-CG (MTTBRB) was presented. This new method solved large-scale unconstrained optimization problems. Despite the fact that the BRB algorithm achieved global convergence by employing a modified strong Wolfe line search, in this new MTTBRB-CG method the researchers employed the classical strong Wolfe-Powell condition (SWPC). This study also attempted to quantify how much better 3-term efficiency is than 2-term efficiency. As a result, in the numerical analysis, the new modification was compared to an effective 2-term CG- method. The numerical analysis demonstrated the effectiveness of the proposed method in solving optimization problems.
Article Details
This work is licensed under a Creative Commons Attribution 4.0 International License.
Tikrit Journal of Pure Science is licensed under the Creative Commons Attribution 4.0 International License, which allows users to copy, create extracts, abstracts, and new works from the article, alter and revise the article, and make commercial use of the article (including reuse and/or resale of the article by commercial entities), provided the user gives appropriate credit (with a link to the formal publication through the relevant DOI), provides a link to the license, indicates if changes were made, and the licensor is not represented as endorsing the use made of the work. The authors hold the copyright for their published work on the Tikrit J. Pure Sci. website, while Tikrit J. Pure Sci. is responsible for appreciate citation of their work, which is released under CC-BY-4.0, enabling the unrestricted use, distribution, and reproduction of an article in any medium, provided that the original work is properly cited.
References
[1] N. Andrei,"Nonlinear Conjugate Gradient Methods for Unconstrained Optimization". Springer Optimization and its Application 158, Springer, Switzerland, (2020), ISBN 978-3-030-42949-2. [2] G. M. Al-Naemi ,"A new modified HS algorithm with strong Powell-Wolfe line search for
unconstrained optimization",Eastern-European Journal of Enterprise Technologies, 116 (2022), 14-21. [3] W. W. Hager and H. Zhang, "A survey of nonlinear conjugate gradient methods", Pacific Journal of Optimization. 2(2006), 35–58.
[4] M. R ل Hestenes ,and Stiefel., E ,"Methods of conjugate gradients for solving linear Systems",
Journal of research of the National Bureau of Standards, 2(1952), 14-21.
[5] R, Fletcher. and Reeves, C. M ,"Function minimization by conjugate gradients ,”The Computer Journal, 7(1964), 149-154.
[6] E. Polak, and G. Ribiere, (1969) ,"Note sur la convergence de méthodes de directions Conjuguées", ESAIM: Mathematical Modelling and Numerical Analysis-Modélisation Mathématique et Analyse Numérique
,3(1969),35-43.
[7] B. T ,Polyak" ,The conjugate gradient method in extreme problems ,”USSR Computational Mathematics and Mathematical Physics ,9(1969), 94-112.
[8] R. Fletcher, (1987) ,"Practical methods of optimization". John Wiley & Sons.
[9] Y ل Liu, and Story, C ,"Efficient generalized conjugate gradient algorithms, Part 1. Theory Journal of optimization theory and applications, 69(1991), 129-137.
[10] Y. H ,Dai, and Yuan, Y ,"A nonlinear conjugate gradient method with a strong global convergence property". SIAM Journal on optimization, 10(1999), 177-182.
[11] J ل Nocedal, and S. Wright, S. (2006), "Numerical Optimization". New York: Springer.
[12] M. Al-Baali ,"Descent property and global convergence of the Fletcher-Reeves method with inexact line search", IMA Journal of Numerical Analysis ,5(1985), 121–124.
[13] L. Zhang, W. Zhou, W. and D ل Li ,"Some descent three-term conjugate gradient methods and their global
convergence ",Optimization Methods and Software ,22(2007), 697–711.
[14] L. Zhang, W. Zhou, and D.H. Li, "A descent modified Polak-Ribiere-Polyak conjugate gradient method and its global convergence ",IMA Journal Numerical Analysis ,26 (2006), 629–40.
[15] J. Zhang, Y. Xiao, and Z. Wei, (2009) ,"Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization ",Mathematical Problems in Engineering.
[16] Z. Wei, S.Yao, L. Liu, ,"The convergence properties of some new conjugate gradient Methods ",Applied Mathematics & Computation, 183(2006) 1341-1350.
[17] M. Mamat, I.M. Sulaiman, A. Umar, K. Kamfa, E.N. madi ," Some three-term conjugate gradient algorithms with descent condition for unconstrained optimization models ",Journal of Advance research in Dynamical and Control Systems ,12 (2020),2494-2501.
[18] B. Baluch, Z. Salleh, A. Alhawarat, and U. A. M. Roslan. ,"A new modified three-term conjugate gradient method with sufficient descent property and its global convergence ",Journal of Mathematics, 5(2017), 1-12.
[19] J. K. Liu, Y. M. Feng, L. M. Zou ,"Some three-term conjugate gradient methods with the inexact line search condition", Calcolo, 55 (2018), 1-16.
[20] M. Malik, A. B. Abubakar, S. M. Ibrahim, M. Mamat, S. S. Abas, and S. Firman, "A New Three-Term Conjugate Gradient Method for Unconstrained Optimization with Applications in Portfolio Selection and Robotic Motion Control ",IAENG International Journal of Applied Mathematics ,51(2021), 1-16.
[21] N. Rahali, M. Belloufi, and R. Benzine, "A new conjugate gradient method for acceleration of gradient descent algorithms " ,Moroccan J. of Pure and Applied Analysis,7(2021), 1-11.
[22] G. M. Al-Naemi ,"The convergent properties of a new parameter for unconstrained Optimization", European Journal of Pure and Applied Mathematics,15(2022), 1683-1693. [23] G. Zoutendijk, ,"Nonlinear programming, computational methods, Integer and nonlinear programming ",In: J. Abadie Ed, Integer and Nonlinear Programming, North-Holland, Amsterdam ,143(1970), 37-86.
[24] L. Dixon, (1972), "Nonlinear Optimization", English University. Press, UK.
[25] A.V. Mandara, M. Mamat, M.Y.Waziri, M.A.Eds Mohamed, U.A. Yakubu" A new conjugate gradient coefficient with exact line search for unconstrained optimization",Far East Journal of Mathematical Sciences,105, (2018), 193–206.
[26] M. Rivaie, M. Mamat, M. Hamoda, and A. Abashar ,"Comparative study of some new conjugate gradient methods",1643(2018), no. July, 616–621.
[27] D. Elizabeth, E.D. Dolan, and J. Jorge e. Mor´ ," Benchmarking optimization software with performance profile ",Mathematical Programming ,91(2002), 201–213.