IDEAS home Printed from https://ideas.repec.org/a/zib/zbmsmk/v9y2025i2p61-65.html

An Enhanced Conjugate Gradient Method For Solving Unconstrained Optimization Problems

Author

Listed:
  • Husein Saleem Ahmed

    (Faculty of Science, University of Zakho, Kurdistan Region, Iraq)

  • Salah Gazi Shareef

    (Faculty of Science, University of Zakho, Kurdistan Region, Iraq)

Abstract

We aimed to develop a conjugate gradient method by reformulating parameters so that iterative optimization techniques perform more effectively. Instead of using a set of basic conjugate gradient formulas, the methodology introduces a new parameter that produces better convergence. The method is applied in Fortran to test how many iterations and how many evaluations of the function are needed, as listed in table 1. The behavior of convergence and the results used for comparison are created with Matplotlib on Python and Ggplot2 on R programming for the chart. We like to compare our method to the proven LS (Liu-Storey) method when checking how effective our proposed method is. We found that the technique provides better results with lower iteration numbers and better convergence speeds for many test cases, proving it can challenge conventional methods in optimizing problems without constraints.

Suggested Citation

  • Husein Saleem Ahmed & Salah Gazi Shareef, 2025. "An Enhanced Conjugate Gradient Method For Solving Unconstrained Optimization Problems," Matrix Science Mathematic (MSMK), Zibeline International Publishing, vol. 9(2), pages 61-65, July.
    • Handle: RePEc:zib:zbmsmk:v:9:y:2025:i:2:p:61-65
    DOI: 10.26480/msmk.02.2025.61.65
    as

    Download full text from publisher

    File URL: https://matrixsmathematic.com/archives/2msmk2025/2msmk2025-61-65.pdf
    Download Restriction: no
    File URL: https://libkey.io/10.26480/msmk.02.2025.61.65?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
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:zib:zbmsmk:v:9:y:2025:i:2:p:61-65. 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: Zibeline International Publishing The email address of this maintainer does not seem to be valid anymore. Please ask Zibeline International Publishing to update the entry or send us the correct address (email available below). General contact details of provider: https://matrixsmathematic.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.