New Hybrid Conjugate Gradient Method as a Convex Combination of Dai–Liao and Wei–Yao–Liu
Article Sidebar
Main Article Content
Abstract
In this research, a new method of hybrid conjugated gradient methods was developed. This method is based mainly on the hybridization of Dia-Laio and Wei-Yao-Liu algorithms, by using convex fitting and conjugate condition of line Uncontrolled search. The resulting algorithm fulfills the condition of sufficient proportions and has universal convergence under certain assumptions. The numerical results indicated the efficiency of this method in solving nonlinear test functions in the given unconstrained optimization.
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] B.T. Polyak, The conjugate gradient method in extreme problems, USSR Comp. Math. Math. Phys. 9 (1969) 94–112.
[2] Dai, Y. H., & Liao, L. Z. (2001). New conjugacy conditions and related nonlinear conjugate gradient methods. Applied Mathematics and Optimization, 43(1), 87-101. .
[3] Dai, Z., & Wen, F. (2012). Another improved Wei–Yao–Liu nonlinear conjugate gradient method with sufficient descent property. Applied Mathematics and Computation, 218(14), 7421-7430.
[4] Dixon, L., (1975), ’CG-Algorithm Quadratic Termination without Line Search’. Journal of Instituted Mathematics and Application, (15), 9-18.
[5] Delladji, S., Belloufi, M., & Sellami, B. (2021). New hybrid conjugate gradient method as a convex combination of FR and BA methods. Journal of Information and Optimization Sciences, 42(3), 591-602.
[6] Dolan, E. D., & Moré, J. J. (2002). Benchmarking optimization software with performance profiles. Mathematical programming, 91(2), 201-213.
[7] G. Zoutendijk, Nonlinear programming computational methods, in: J. Abadie (Ed.), Integer and Nonlinear Programming, North-Holland, 1970, pp. 37–86
[8] Gilber, J. C., & Nocedal, J. (1992). Global convergence properties of conjugate gradient. SIAM Journal of Optimization, 2, 21-42.
[9] Khalil, A. B. B. O., & HAMEED, N. (2018). New hybrid conjugate gradient method as a convex combination of Liu-Storey and Dixon methods. Journal of Multidisciplinary Modeling and Optimization, 1(2), 91-99.
[10] Lu, J., Yuan, G., & Wang, Z. (2021). A modified Dai–Liao conjugate gradient method for solving unconstrained optimization and image restoration problems. Journal of Applied Mathematics and Computing, 1-23.
[11] M.R. Hestenes, E. Stiefel, Method of conjugate gradient for solving linear equations, J. Res. Nat. Bur. Stand. 49 (1952) 409–436.
[12] R. Fletcher, C. Reeves, Function minimization by conjugate gradients, Compute. J. 7 (1964) 149–154.
[13] R. Fletcher, Practical Method of Optimization, second ed., Unconstrained Optimization, vol. I, Wiley, New York, 1997.
[14] Y. Dai, Y. Yuan, A nonlinear conjugate gradient with a strong global convergence properties, SIAM J. Optim. 10 (2000) 177–182.
[15] Y. Liu, C. Storey, Efficient generalized conjugate gradient algorithms, part 1: theory, J. Optim. Theory Appl. 69 (1992) 129–137.
[16] Yuan, G., Li, T., & Hu, W. (2020). A conjugate gradient algorithm for large-scale nonlinear equations and image restoration problems. Applied Numerical Mathematics, 147, 129-141.
[17] Yuan, G., Meng, Z., & Li, Y. (2016). A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations. Journal of Optimization Theory and Applications, 168(1), 129-152.
[18] Salih, B. M., Abbo, K. K., & Abdullah, Z. M. (2018). Partial Pearson-two (PP2) of quasi newton method for unconstrained optimization. Tikrit Journal of Pure Science, 21(3), 174-179.
[19] Zeyad M Abdullah 2016 New Partial and Memoryless Rank-One and Rank-Two Quasi-Newton Method
[20] Zhang, L. (2009). An improved Wei–Yao–Liu nonlinear conjugate gradient method for optimization computation. Applied Mathematics and computation, 215(6), 2269-2274.