IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v88y2024i3d10.1007_s10589-024-00569-5.html
   My bibliography  Save this article

Nonsmooth nonconvex optimization on Riemannian manifolds via bundle trust region algorithm

Author

Listed:
  • N. Hoseini Monjezi

    (University of Isfahan)

  • S. Nobakhtian

    (University of Isfahan)

  • M. R. Pouryayevali

    (University of Isfahan)

Abstract

This paper develops an iterative algorithm to solve nonsmooth nonconvex optimization problems on complete Riemannian manifolds. The algorithm is based on the combination of the well known trust region and bundle methods. According to the process of the most bundle methods, the objective function is approximated by a piecewise linear working model which is updated by adding cutting planes at unsuccessful trial steps. Then at each iteration, by solving a subproblem that employs the working model in the objective function subject to the trust region, a candidate descent direction is obtained. We study the algorithm from both theoretical and practical points of view and its global convergence is verified to stationary points for locally Lipschitz functions. Moreover, in order to demonstrate the reliability and efficiency, a MATLAB implementation of the proposed algorithm is prepared and results of numerical experiments are reported.

Suggested Citation

  • N. Hoseini Monjezi & S. Nobakhtian & M. R. Pouryayevali, 2024. "Nonsmooth nonconvex optimization on Riemannian manifolds via bundle trust region algorithm," Computational Optimization and Applications, Springer, vol. 88(3), pages 871-902, July.
    • Handle: RePEc:spr:coopap:v:88:y:2024:i:3:d:10.1007_s10589-024-00569-5
    DOI: 10.1007/s10589-024-00569-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-024-00569-5
    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/s10589-024-00569-5?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:coopap:v:88:y:2024:i:3:d:10.1007_s10589-024-00569-5. 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.