IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v112y2002i1d10.1023_a1013004914923.html
   My bibliography  Save this article

Convergence of the DFP Algorithm Without Exact Line Search

Author

Listed:
  • D. Pu

    (Tongji University)

Abstract

In this paper, we consider the DFP algorithm without exact line search. We strengthen the conditions on the line search and prove that, under the new line search conditions, the DFP algorithm is globally convergent, Q-superlinearly convergent, and n-step quadratically convergent.

Suggested Citation

  • D. Pu, 2002. "Convergence of the DFP Algorithm Without Exact Line Search," Journal of Optimization Theory and Applications, Springer, vol. 112(1), pages 187-211, January.
    • Handle: RePEc:spr:joptap:v:112:y:2002:i:1:d:10.1023_a:1013004914923
    DOI: 10.1023/A:1013004914923
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1013004914923
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1013004914923?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Najib Ullah & Abdullah Shah & Jamilu Sabi’u & Xiangmin Jiao & Aliyu Muhammed Awwal & Nuttapol Pakkaranang & Said Karim Shah & Bancha Panyanak, 2023. "A One-Parameter Memoryless DFP Algorithm for Solving System of Monotone Nonlinear Equations with Application in Image Processing," Mathematics, MDPI, vol. 11(5), pages 1-26, March.
    2. Fatemeh Dargahi & Saman Babaie-Kafaki & Zohre Aminifard, 2024. "Eigenvalue Analyses on the Memoryless Davidon–Fletcher–Powell Method Based on a Spectral Secant Equation," Journal of Optimization Theory and Applications, Springer, vol. 200(1), pages 394-403, January.

    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:spr:joptap:v:112:y:2002:i:1:d:10.1023_a:1013004914923. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.