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

A Framework for Globally Convergent Algorithms Using Gradient Bounding Functions

Author

Listed:
  • X. Wang

    (University of California)

  • T. S. Chang

    (University of California)

Abstract

This paper presents a novel framework for developing globally convergent algorithms without evaluating the value of a given function. One way to implement such a framework for a twice continuously differentiable function is to apply linear bounding functions (LBFs) to its gradient function. The algorithm thus obtained can get a better point in each iteration without using a line search. Under certain conditions, it can achieve at least superlinear convergent rate 1.618 without calculating explicitly the Hessian. Furthermore, the strategy of switching from the negative gradient direction to the Newton-alike direction is derived in a natural manner and is computationally effective. Numerical examples are used to show how the algorithm works.

Suggested Citation

  • X. Wang & T. S. Chang, 1999. "A Framework for Globally Convergent Algorithms Using Gradient Bounding Functions," Journal of Optimization Theory and Applications, Springer, vol. 100(3), pages 661-697, March.
    • Handle: RePEc:spr:joptap:v:100:y:1999:i:3:d:10.1023_a:1022694608370
    DOI: 10.1023/A:1022694608370
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1022694608370
    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:1022694608370?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.

    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:100:y:1999:i:3:d:10.1023_a:1022694608370. 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.