IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/4381515.html
   My bibliography  Save this article

A Modified Three-Term Type CD Conjugate Gradient Algorithm for Unconstrained Optimization Problems

Author

Listed:
  • Zhan Wang
  • Pengyuan Li
  • Xiangrong Li
  • Hongtruong Pham

Abstract

Conjugate gradient methods are well-known methods which are widely applied in many practical fields. CD conjugate gradient method is one of the classical types. In this paper, a modified three-term type CD conjugate gradient algorithm is proposed. Some good features are presented as follows: (i) A modified three-term type CD conjugate gradient formula is presented. (ii) The given algorithm possesses sufficient descent property and trust region property. (iii) The algorithm has global convergence with the modified weak Wolfe–Powell (MWWP) line search technique and projection technique for general function. The new algorithm has made great progress in numerical experiments. It shows that the modified three-term type CD conjugate gradient method is more competitive than the classical CD conjugate gradient method.

Suggested Citation

  • Zhan Wang & Pengyuan Li & Xiangrong Li & Hongtruong Pham, 2020. "A Modified Three-Term Type CD Conjugate Gradient Algorithm for Unconstrained Optimization Problems," Mathematical Problems in Engineering, Hindawi, vol. 2020, pages 1-14, September.
    • Handle: RePEc:hin:jnlmpe:4381515
    DOI: 10.1155/2020/4381515
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2020/4381515.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2020/4381515.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2020/4381515?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Aliyu Muhammed Awwal & Mahmoud Muhammad Yahaya & Nuttapol Pakkaranang & Nattawut Pholasa, 2024. "A New Variant of the Conjugate Descent Method for Solving Unconstrained Optimization Problems and Applications," Mathematics, MDPI, vol. 12(15), pages 1-13, August.

    More about this item

    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:hin:jnlmpe:4381515. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.