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

A new proximal heavy ball inexact line-search algorithm

Author

Listed:
  • S. Bonettini

    (Università degli Studi di Modena e Reggio Emilia)

  • M. Prato

    (Università degli Studi di Modena e Reggio Emilia)

  • S. Rebegoldi

    (Università degli Studi di Modena e Reggio Emilia)

Abstract

We study a novel inertial proximal-gradient method for composite optimization. The proposed method alternates between a variable metric proximal-gradient iteration with momentum and an Armijo-like linesearch based on the sufficient decrease of a suitable merit function. The linesearch procedure allows for a major flexibility on the choice of the algorithm parameters. We prove the convergence of the iterates sequence towards a stationary point of the problem, in a Kurdyka–Łojasiewicz framework. Numerical experiments on a variety of convex and nonconvex problems highlight the superiority of our proposal with respect to several standard methods, especially when the inertial parameter is selected by mimicking the Conjugate Gradient updating rule.

Suggested Citation

  • S. Bonettini & M. Prato & S. Rebegoldi, 2024. "A new proximal heavy ball inexact line-search algorithm," Computational Optimization and Applications, Springer, vol. 88(2), pages 525-565, June.
    • Handle: RePEc:spr:coopap:v:88:y:2024:i:2:d:10.1007_s10589-024-00565-9
    DOI: 10.1007/s10589-024-00565-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-024-00565-9
    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-00565-9?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:2:d:10.1007_s10589-024-00565-9. 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.