IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v154y2012i3d10.1007_s10957-012-0041-6.html
   My bibliography  Save this article

Convergence Rate of the Pham Dinh–Le Thi Algorithm for the Trust-Region Subproblem

Author

Listed:
  • Hoang Ngoc Tuan

    (Hanoi Pedagogical University No. 2)

Abstract

We obtain sufficient conditions for the linear convergence of the iterative sequences produced by the Pham Dinh–Le Thi algorithm for the trust-region subproblem. In addition, we give two examples to show that, if the sufficient conditions are not satisfied, then the sequences may not be linearly convergent.

Suggested Citation

  • Hoang Ngoc Tuan, 2012. "Convergence Rate of the Pham Dinh–Le Thi Algorithm for the Trust-Region Subproblem," Journal of Optimization Theory and Applications, Springer, vol. 154(3), pages 904-915, September.
    • Handle: RePEc:spr:joptap:v:154:y:2012:i:3:d:10.1007_s10957-012-0041-6
    DOI: 10.1007/s10957-012-0041-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-012-0041-6
    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-012-0041-6?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. Hoang Ngoc Tuan, 2015. "Boundedness of a Type of Iterative Sequences in Two-Dimensional Quadratic Programming," Journal of Optimization Theory and Applications, Springer, vol. 164(1), pages 234-245, January.
    2. Hoai An Le Thi & Van Ngai Huynh & Tao Pham Dinh, 2018. "Convergence Analysis of Difference-of-Convex Algorithm with Subanalytic Data," Journal of Optimization Theory and Applications, Springer, vol. 179(1), pages 103-126, October.
    3. Amar Andjouh & Mohand Ouamer Bibi, 2022. "Adaptive Global Algorithm for Solving Box-Constrained Non-convex Quadratic Minimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 192(1), pages 360-378, 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:154:y:2012:i:3:d:10.1007_s10957-012-0041-6. 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.