IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v129y2006i1d10.1007_s10957-006-9053-4.html
   My bibliography  Save this article

Superlinearly Convergent Trust-Region Method without the Assumption of Positive-Definite Hessian

Author

Listed:
  • J. L. Zhang

    (Management School of Graduate University, Chinese Academy of Sciences)

  • Y. Wang

    (Academy of Mathematics and Systems Science, Chinese Academy of Sciences)

  • X. S. Zhang

    (Academy of Mathematics and Systems Science, Chinese Academy of Sciences)

Abstract

In this paper, we reinvestigate the trust-region method by reformulating its subproblem: the trust-region radius is guided by gradient information at the current iteration and is self-adaptively adjusted. A trust-region algorithm based on the proposed subproblem is proved to be globally convergent. Moreover, the superlinear convergence of the new algorithm is shown without the condition that the Hessian of the objective function at the solution be positive definite. Preliminary numerical results indicate that the performance of the new method is notable.

Suggested Citation

  • J. L. Zhang & Y. Wang & X. S. Zhang, 2006. "Superlinearly Convergent Trust-Region Method without the Assumption of Positive-Definite Hessian," Journal of Optimization Theory and Applications, Springer, vol. 129(1), pages 201-218, April.
  • Handle: RePEc:spr:joptap:v:129:y:2006:i:1:d:10.1007_s10957-006-9053-4
    DOI: 10.1007/s10957-006-9053-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-006-9053-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10957-006-9053-4?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:129:y:2006:i:1:d:10.1007_s10957-006-9053-4. 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.