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

On the Convergence of Proximal Gradient Methods for Convex Simple Bilevel Optimization

Author

Listed:
  • Puya Latafat

    (IMT School for Advanced Studies Lucca)

  • Andreas Themelis

    (Kyushu University)

  • Silvia Villa

    (Università di Genova)

  • Panagiotis Patrinos

    (KU Leuven)

Abstract

This paper studies proximal gradient iterations for addressing simple bilevel optimization problems where both the upper and the lower level cost functions are split as the sum of differentiable and (possibly nonsmooth) prox-friendly functions. We develop a novel convergence recipe for iteration-varying stepsizes that relies on Barzilai-Borwein type local estimates for the differentiable terms. Leveraging the convergence recipe, under global Lipschitz gradient continuity, we establish convergence for a nonadaptive stepsize sequence, without requiring any strong convexity or linesearch. In the locally Lipschitz differentiable setting, we develop an adaptive linesearch method that introduces a systematic adaptive scheme enabling large and nonmonotonic stepsize sequences while being insensitive to the choice of hyperparameters and initialization. Numerical simulations are provided showcasing favorable convergence speed of our methods.

Suggested Citation

  • Puya Latafat & Andreas Themelis & Silvia Villa & Panagiotis Patrinos, 2025. "On the Convergence of Proximal Gradient Methods for Convex Simple Bilevel Optimization," Journal of Optimization Theory and Applications, Springer, vol. 204(3), pages 1-36, March.
    • Handle: RePEc:spr:joptap:v:204:y:2025:i:3:d:10.1007_s10957-024-02564-6
    DOI: 10.1007/s10957-024-02564-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-024-02564-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-024-02564-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.

    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:204:y:2025:i:3:d:10.1007_s10957-024-02564-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.