Open Access
Research Article
Efficient one-parameter family of conjugate gradient methods
*Samia KhelladiCorresponding authorsamia.boukaroura@univ-setif.dzLaboratory of Fundamental and Numerical Mathematics LMFN Faculty of Sciences University of Setif-1Department of Mathematics Laboratory of Fundamental and Numerical Mathematics Faculty of Sciences University of Ferhat Abbas Setif-1Ferhat Abbas, 19000, AlgeriaView full profile → , Dj. Benterkidjbenterki@univ-setif.dzLaboratory of Fundamental and Numerical Mathematics LMFN Faculty of Sciences University of Setif-1Department of Mathematics Laboratory of Fundamental and Numerical Mathematics Ferhat Abbas UniversitySetif, 19000, AlgeriaView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 05 Oct 2021
- Published Online:
- 27 Apr 2024
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JIOS-1354
- Pages:
- 699–715
Abstract
We present an efficient one-parameter family of conjugate gradient methods for unconstrained optimization problems. These methods are defined using a combination of the Polak-Ribiere-Polyak method and the Rivaie-Mustafa-Ismail-Leong method. We prove the global convergence based on the Wolfe line search for nonlinear objective functions. Finally, we give some numerical experiments, proving the efficiency of the proposed approach.
Keywords
Subject Classifications
(2010) 65K0590C2690C30
References
[1] Andrei, N.: An unconstrained optimization test functions collection. Adv. Model. Optim. 10, 147–161 (2008).[2] Dai, Y.H., Liao, L.Z.: New conjugacy conditions and related nonlinear conjugate gradient methods. Appl. Math. Optim. 43(1), 87–101 (2001).[3] Dai, Y.H., Yuan, Y.: A class of globally convergent conjugate gradient methods. Sci. China Ser. A-Math. 46, 251–261 (2003).[4] Dai, Y.H., Yuan, Y.: An efficient hybrid conjugate gradient method for unconstrained optimization. Ann. Oper. Res. 103, 33–47 (2001).[5] Dai, Y.H., Yuan, Y.: A nonlinear conjugate gradient method with a strong global convergence property. SIAM J. Optim. 10(1), 177–182 (1999).[6] Delladji, S., Belloufi, M., Sellami, B.: New hybrid conjugate gradient method as a convex combination of FR and BA methods. Journal of Information and Optimization Sciences, 42(3), 591-602 (2021).[7] Fletcher, R.: Practical Methods of Optimization. Unconstrained Optimization, vol. 1. Wiley, New York (1987).[8] Fletcher, R., Reeves, C.M.: Function minimization by conjugate gradients. Comput. J. 7(2), 149–154 (1964).[9] Gilbert, J.C., Nocedal, J.: Global convergence properties of conjugate gradient methods for optimization. SIAM J. Optim. 2(1), 21–42 (1992).[10] Hassan, B.A., Kahya, M.A.: A new class of quasi-Newton updating formulas for unconstrained optimization. Journal of Interdisciplinary Mathematics, 24(8), 2355-2366 (2021).[11] Hestenes, M.R., Stiefel, E.: Methods of conjugate gradients for solving linear systems. J. Res. Natl. Bur. Stand. 49(6), 409–436 (1952).[12] Liu, Y., Storey, C.: Efficient generalized conjugate gradient algorithms, part 1: theory. J. Optim. Theory Appl. 69(1), 129–137 (1991).[13] Mtagulwa, P., Kaelo, P.: A convergent modified HS-DY hybrid conjugate gradient method for unconstrained optimization problems. Journal of Information and Optimization Sciences, 40(1), 97-113 (2019).[14] Polak, E., Ribiere, G.: Note sur la convergence des méthodes de directions conjuguées. Rev. Française Imformat Recherche Opertionelle 16, 35–43 (1969).[15] Polyak, B.T.: The conjugate gradient method in extreme problems. U.S.S.R. Comput. Math. Phys. 9, 94–112 (1969).[16] Pu, D., Yu, W.: On the convergence property of the DFP algorithm. Ann Oper Res 24, 175–184 (1990).[17] Rivaie, M., Mustafa, M., Leong W. J., Ismail, M.: A new class of nonlinear conjugate gradient coefficients with global convergence properties. Applied Mathematics and Computation, 218(22), 11323–11332 (2012).[18] Sellami, B., Chaib, Y.: A new family of globally convergent conjugate gradient methods. Ann. Oper. Res. Springer, 241, 497–513 (2016).[19] Sellami, B., Chaib, Y.: New conjugate gradient method for unconstrained optimization. RAIRO Operations Research, 50, 1013–1026 (2016).[20] Yang, X., Luo, Z., Dai, X.: A global convergence of LS-CD hybrid conjugate gradient method. Advances in Numerical Analysis (2013).[21] Zheng, Y., Zheng, B.: Two new Dai-Liao-type conjugate gradient methods for unconstrained optimization problems. J. Optim. Theory Appl. 175, 502–509 (2017).[22] Zoutendijk, G.: Nonlinear programming, computational methods. In: Abadie, J. (ed.) Integer and Nonlinear Programming, 37–86 (1970).
Views: 120Downloads: 9Citations: 0
