Research Article Open Access

Two-Versions of Conjugate Gradient-Algorithms Based on Conjugacy Conditions for Unconstrained Optimization

Abbas Y. AL-Bayati1, A.J. Salim1 and Khalel K. Abbo1
  • 1 Mosul University, Iraq

Abstract

Problem statement: (CG) algorithms, which we had investigated in this study, were widely used in optimization, especially for large scale optimization problems, because it did not need the storage of any matrix. The purpose of this construction was to find new CG-algorithms suitable for solving large scale optimization problems. Approach: Based on pure conjugacy condition and quadratic convex function two new versions of (CG) algorithms were derived and observed that they were generate descent directions for each iteration, the global convergence analysis of these algorithms with Wolfe line search conditions had been proved. Results: Numerical results for some standard test functions were reported and compared with the classical Fletcher-Reeves and Hestenes-Stiefel algorithms showing considerable improving over these standard CG-algorithms. Conclusion: Two new versions of CG-algorithms were proposed in this study with their numerical properties and convergence analysis and they were out perform on the standard HS and FR CG-algorithms.

American Journal of Economics and Business Administration
Volume 1 No. 2, 2009, 97-104

DOI: https://doi.org/10.3844/ajebasp.2009.97.104

Published On: 30 June 2009

How to Cite: AL-Bayati, A. Y., Salim, A. & Abbo, K. K. (2009). Two-Versions of Conjugate Gradient-Algorithms Based on Conjugacy Conditions for Unconstrained Optimization . American Journal of Economics and Business Administration, 1(2), 97-104. https://doi.org/10.3844/ajebasp.2009.97.104

  • 3,599 Views
  • 2,246 Downloads
  • 1 Citations

Download

Keywords

  • (CG) algorithms
  • exact line searches
  • global convergence properties