A new conjugate gradient method for acceleration of gradient descent algorithms

[1] M. Al-Baali, Descent property and global convergence of the Fletcher–Reeves method with inexact line search, IMA J. Numer. Anal. 5 (1985) 121–124.10.1093/imanum/5.1.121Search in Google Scholar

[2] N. Andrei, An unconstrained optimization test functions collection, Advanced Modeling and Optimization, An Electronic International Journal 10 (2008) 147–161.Search in Google Scholar

[3] M. Belloufi, R. Benzine, Descent property and global convergence of a new search direction method for unconstrained optimization, Numerical Functional Analysis and Optimization, 36(2), 169-180, Taylor & Francis Group 2014.10.1080/01630563.2014.976796Search in Google Scholar

[4] Sh. Sadigh Behzadi and A. Yildirim, Numerical solution of lr fuzzy hunter-saxeton equation by using homo-topy analysis method, Journal of Applied Analysis and Computation, 2012, Vol.2, (1):1-10.10.11948/2012001Search in Google Scholar

[5] R. Benouahboun, A. Mansouri, An interior point algorithm for convex quadratic programming with strict equilibrium. RAIRO Oper. Res. 39 (2005) 13-33.Search in Google Scholar

[6] M.Q. Chen, S. -P. Han, A parallel quasi-Newton method for partially separable large scale minimization, Annals of Operations Research, 1988, Volume 14, Issue 1, pp 195-211.10.1007/BF02186480Search in Google Scholar

[7] E. Dolan, J. J. Moré (2002). Benchmarking optimization software with performance profiles. Mathematical Programming 91:201–213.Search in Google Scholar

[8] Y. Dai, Convergence properties of the BFGS algorithm. SIAM Journal on Optimization, 13 (2003) 693–701.Search in Google Scholar

[9] J. E. Dennis, Jr., J. J. Moré, (1977). Quasi-Newton methods, motivation and theory. SIAM Review, 19, 46–89.10.1137/1019005Search in Google Scholar

[10] X. Dong, W.j. Li, Y.b. He, Some modified Yabe-Takano Conjugate gradient methods with Sufficient descent condition. RAIRO-Oper. Res. 2016.DOI: http://dx.doi.org/10.1051/ro/2016028.10.1051/ro/2016028Search in Google Scholar

[11] Sarra Delladji, Mohammed Belloufi, Badereddine Sellami, Behavior of the combination of PRP and HZ methods for unconstrained optimization, Numerical Algebra Control And Optimization, (2020), doi:10.3934/naco.202003210.3934/naco.2020032Search in Google Scholar

[12] Y.H. Dai, Y. Yuan, An Efficient Hybrid Conjugate Gradient Method for Unconstrained Optimization, Annals of Operations Research, March 2001, Volume 103, Issue 1-4, pp 33-4710.1023/A:1012930416777Search in Google Scholar

[13] S. Deng, Coercivity properties and well-posedness in vector optimization. RAIRO Oper. Res. 37 (2003) 195-208.Search in Google Scholar

[14] R. Fletcher, Practical Method of Optimization, second ed., Unconstrained Optimization, vol. I, Wiley, New York, 1997.Search in Google Scholar

[15] M.C. Ferris, A.J. Wathen, P. Armand, Limited memory solution of bound constrained convex quadratic problems arising in video games. RAIRO Oper. Res. 41 (2007) 19-34.Search in Google Scholar

[16] M.R. Hestenes, E. Stiefel, Method of conjugate gradient for solving linear equations, J. Res. Nat. Bur. Stand. 49 (1952) 409–436.10.6028/jres.049.044Search in Google Scholar

[17] W.W. Hager, H. Zhang, A new conjugate gradient method with guaranteed descent and an efficient line search, SIAM Journal on Optimization 16 (2005) 170–192.10.1137/030601880Search in Google Scholar

[18] S.B. Kafaki, R. Ghanbari, A descent hybrid modification of the Polak–Ribière–Polyak conjugate gradient method. RAIRO-Oper. Res. 50 (2016) 567-574.Search in Google Scholar

[19] Y. Liu, C. Storey, Efficient generalized conjugate gradient algorithms. Part 1: Theory, J. Optimiz. Theory Appl. 69 (1992) 129–137.10.1007/BF00940464Search in Google Scholar

[20] J. Nocedal, S.J. Wright, Numerical optimization, Springer Series in Operations Research, Springer, New York, 1999.10.1007/b98874Search in Google Scholar

[21] J. Nocedal, Conjugate gradient methods and nonlinear optimization, in: L. Adams, J.L. Nazareth (Eds.), Linear and Nonlinear Conjugate Gradient Related Methods, SIAM, Philadelphia, PA, 1995, pp. 9–23.Search in Google Scholar

[22] M.J.D. Powell, Nonconvex minimization calculations and the conjugate gradient method, Lecture Notes in Math. 1066 (1984) 121–141.Search in Google Scholar

[23] B.T. Polyak, The conjugate gradient method in extreme problems, USSR Comp. Math. Math. Phys. 9 (1969) 94–112.10.1016/0041-5553(69)90035-4Search in Google Scholar

[24] M. A. Rincon, M. I. M. Copetti, Numerical analysis for a locally damped wave equation, Journal of Applied Analysis and Computation, 2013, Vol.3, (2):169-182.10.11948/2013013Search in Google Scholar

[25] J. Schropp, A note on minimization problems and multistep methods. Numeric Mathematic, 78 (1997) 87–101.Search in Google Scholar

[26] N.H. Zhao, Y. Xia, W. Liu, P. J. Y. Wong and R. T. Wang, Existence of Almost Periodic Solutions of a Nonlinear System, Journal of Applied Analysis and Computation, 2013, Vol.3, (3):301-306.10.11948/2013022Search in Google Scholar

[27] Z.J. Shi, X.S. Zhang, J. Shen, Convergence analysis of adaptive trust region methods. RAIRO Oper. Res. 41 (2007) 105-121.Search in Google Scholar

[28] C. Xu, J. Zhang, A Survey of Quasi-Newton Equations and Quasi-Newton Methods for Optimization, Annals of Operations Research,2001, Volume 103, Issue 1-4, pp 213-234.Search in Google Scholar