IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v89y2024i4d10.1007_s10898-024-01378-0.html
   My bibliography  Save this article

Convergence and worst-case complexity of adaptive Riemannian trust-region methods for optimization on manifolds

Author

Listed:
  • Zhou Sheng

    (Anhui University of Technology
    Anhui Provincial Joint Key Laboratory of Disciplines for Industrial Big Data Analysis and Intelligent Decision)

  • Gonglin Yuan

    (Guangxi University)

Abstract

Trust-region methods have received massive attention in a variety of continuous optimization. They aim to obtain a trial step by minimizing a quadratic model in a region of a certain trust-region radius around the current iterate. This paper proposes an adaptive Riemannian trust-region algorithm for optimization on manifolds, in which the trust-region radius depends linearly on the norm of the Riemannian gradient at each iteration. Under mild assumptions, we establish the liminf-type convergence, lim-type convergence, and global convergence results of the proposed algorithm. In addition, the proposed algorithm is shown to reach the conclusion that the norm of the Riemannian gradient is smaller than $$\epsilon $$ ϵ within $${\mathcal {O}}(\frac{1}{\epsilon ^2})$$ O ( 1 ϵ 2 ) iterations. Some numerical examples of tensor approximations are carried out to reveal the performances of the proposed algorithm compared to the classical Riemannian trust-region algorithm.

Suggested Citation

  • Zhou Sheng & Gonglin Yuan, 2024. "Convergence and worst-case complexity of adaptive Riemannian trust-region methods for optimization on manifolds," Journal of Global Optimization, Springer, vol. 89(4), pages 949-974, August.
    • Handle: RePEc:spr:jglopt:v:89:y:2024:i:4:d:10.1007_s10898-024-01378-0
    DOI: 10.1007/s10898-024-01378-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-024-01378-0
    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/s10898-024-01378-0?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:jglopt:v:89:y:2024:i:4:d:10.1007_s10898-024-01378-0. 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.