Shahrina IsmailAhmad AlhawaratIbtisam A. MasmaliHanan AlolaiyanZabidin Salleh2024-05-292024-05-292021-102022-2-14Alhawarat, A., Alolaiyan, H., Masmali, I. A., Salleh, Z., & Ismail, S. (2021). A Descent Four-Term of Liu and Storey Conjugate Gradient Method for Large Scale Unconstrained Optimization Problems. European Journal of Pure and Applied Mathematics, 14(4), 1429–1456. https://doi.org/10.29020/nybg.ejpam.v14i4.41281307-55432243-1010.29020/nybg.ejpam.v14i4.4128https://oarep.usim.edu.my/handle/123456789/10493The conjugate gradient (CG) method is a useful tool for obtaining the optimum point for unconstrained optimization problems since it does not require a second derivative or its approximations. Moreover, the conjugate gradient method can be applied in many fields such as machine learning, deep learning, neural network, and many others. This paper constructs a four-term conjugate gradient method that satisfies the descent property and convergence properties to obtain the stationary point. The new modification was constructed based on Liu and Storey's conjugate gradient method, two-term conjugate gradient method, and three-term conjugate gradient method. To analyze the efficiency and robustness, we used more than 150 optimization functions from the CUTEst library with different dimensions and shapes. The numerical results show that the new modification outperforms the recent conjugate gradient methods such as CG-Descent, Dai and Liao, and others in terms of number of functions evaluations, number of gradient evaluations, number of iterations, and CPU time.enConjugate gradient method, Wolfe Powell line search, Descent condition, ConvergenceArticle14291456144