IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v77y2020i2d10.1007_s10589-020-00218-7.html
   My bibliography  Save this article

On the interplay between acceleration and identification for the proximal gradient algorithm

Author

Listed:
  • Gilles Bareilles

    (Univ. Grenoble Alpes)

  • Franck Iutzeler

    (Univ. Grenoble Alpes)

Abstract

In this paper, we study the interplay between acceleration and structure identification for the proximal gradient algorithm. While acceleration is generally beneficial in terms of functional decrease, we report and analyze several cases where its interplay with identification has negative effects on the algorithm behavior (iterates oscillation, loss of structure, etc.). Then, we present a generic method that tames acceleration when structure identification may be at stake; it benefits from a convergence rate that matches the one of the accelerated proximal gradient under some qualifying condition. We show empirically that the proposed method is much more stable in terms of subspace identification compared to the accelerated proximal gradient method while keeping a similar functional decrease.

Suggested Citation

  • Gilles Bareilles & Franck Iutzeler, 2020. "On the interplay between acceleration and identification for the proximal gradient algorithm," Computational Optimization and Applications, Springer, vol. 77(2), pages 351-378, November.
    • Handle: RePEc:spr:coopap:v:77:y:2020:i:2:d:10.1007_s10589-020-00218-7
    DOI: 10.1007/s10589-020-00218-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-020-00218-7
    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-020-00218-7?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.

    References listed on IDEAS

    as
    1. Franck Iutzeler & Jérôme Malick, 2018. "On the Proximal Gradient Algorithm with Alternated Inertia," Journal of Optimization Theory and Applications, Springer, vol. 176(3), pages 688-710, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ferdinard U. Ogbuisi & Yekini Shehu & Jen-Chih Yao, 2023. "Relaxed Single Projection Methods for Solving Bilevel Variational Inequality Problems in Hilbert Spaces," Networks and Spatial Economics, Springer, vol. 23(3), pages 641-678, September.
    2. Seakweng Vong & Zhongsheng Yao, 2024. "Modified general splitting method for the split feasibility problem," Journal of Global Optimization, Springer, vol. 90(3), pages 711-726, November.
    3. Yekini Shehu & Qiao-Li Dong & Lulu Liu & Jen-Chih Yao, 2023. "Alternated inertial subgradient extragradient method for equilibrium problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 31(1), pages 1-30, April.
    4. Luis M. Briceño-Arias & Giovanni Chierchia & Emilie Chouzenoux & Jean-Christophe Pesquet, 2019. "A random block-coordinate Douglas–Rachford splitting method with low computational complexity for binary logistic regression," Computational Optimization and Applications, Springer, vol. 72(3), pages 707-726, April.
    5. Wenli Huang & Yuchao Tang & Meng Wen & Haiyang Li, 2022. "Relaxed Variable Metric Primal-Dual Fixed-Point Algorithm with Applications," Mathematics, MDPI, vol. 10(22), pages 1-16, November.
    6. Huan Zhang & Xiaolan Liu & Yan Sun & Ju Hu, 2023. "An Alternated Inertial Projection Algorithm for Multi-Valued Variational Inequality and Fixed Point Problems," Mathematics, MDPI, vol. 11(8), pages 1-13, April.

    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:77:y:2020:i:2:d:10.1007_s10589-020-00218-7. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.