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

The indefinite proximal gradient method

Author

Listed:
  • Geoffroy Leconte

    (Polytechnique Montréal)

  • Dominique Orban

    (Polytechnique Montréal)

Abstract

We introduce a monotone and a non-monotone variant of the proximal gradient method in which the quadratic term is diagonal but may be indefinite, and is safeguarded by a trust region. Our method is a special case of the proximal quasi-Newton trust-region method of Aravkin et al. (SIAM J Optim 32(2):900–929, 2022). We provide closed-form solution of the step computation in certain cases where the nonsmooth term is separable and the trust region is defined in the infinity norm, so that no iterative subproblem solver is required. Our analysis expands upon that of (Aravkin et al. in SIAM J Optim 32(2):900–929, 2022) by generalizing the trust-region approach to problems with bound constraints. We provide an efficient open-source implementation of our method, named TRDH, in the Julia language in which Hessians approximations are given by diagonal quasi-Newton updates. TRDH evaluates one standard proximal operator and one indefinite proximal operator per iteration. We also analyze and implement a variant named iTRDH that performs a single indefinite proximal operator evaluation per iteration. We establish that iTRDH enjoys the same asymptotic worst-case iteration complexity as TRDH. We report numerical experience on unconstrained and bound-constrained problems, where TRDH and iTRDH are used both as standalone and subproblem solvers. Our results illustrate that, as standalone solvers, TRDH and iTRDH improve upon the quadratic regularization method R2 of (Aravkin et al. in SIAM J Optim 32(2):900–929, 2022) but also sometimes upon their quasi-Newton trust-region method, referred to here as TR-R2, in terms of smooth objective value and gradient evaluations. On challenging nonnegative matrix factorization, binary classification and data fitting problems, TRDH and iTRDH used as subproblem solvers inside TR improve upon TR-R2 for at least one choice of diagonal approximation and memory parameter.

Suggested Citation

  • Geoffroy Leconte & Dominique Orban, 2025. "The indefinite proximal gradient method," Computational Optimization and Applications, Springer, vol. 91(2), pages 861-903, June.
  • Handle: RePEc:spr:coopap:v:91:y:2025:i:2:d:10.1007_s10589-024-00604-5
    DOI: 10.1007/s10589-024-00604-5
    as

    Download full text from publisher

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

    More about this item

    Statistics

    Access and download statistics

    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:91:y:2025:i:2:d:10.1007_s10589-024-00604-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.