IDEAS home Printed from https://ideas.repec.org/a/abk/jajeba/ajebasp.2009.97.104.html
   My bibliography  Save this article

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

Author

Listed:
  • Abbas Y. AL-Bayati
  • A.J. Salim
  • Khalel K. Abbo

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.

Suggested Citation

  • Abbas Y. AL-Bayati & A.J. Salim & Khalel K. Abbo, 2009. "Two-Versions of Conjugate Gradient-Algorithms Based on Conjugacy Conditions for Unconstrained Optimization," American Journal of Economics and Business Administration, Science Publications, vol. 1(2), pages 97-104, June.
    • Handle: RePEc:abk:jajeba:ajebasp.2009.97.104
    DOI: 10.3844/ajebasp.2009.97.104
    as

    Download full text from publisher

    File URL: https://thescipub.com/pdf/ajebasp.2009.97.104.pdf
    Download Restriction: no
    File URL: https://thescipub.com/abstract/ajebasp.2009.97.104
    Download Restriction: no
    File URL: https://libkey.io/10.3844/ajebasp.2009.97.104?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:abk:jajeba:ajebasp.2009.97.104. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Jeffery Daniels (email available below). General contact details of provider: https://thescipub.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.