IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v207y2025i3d10.1007_s10957-025-02817-y.html
   My bibliography  Save this article

A Randomized Algorithm for Nonconvex Minimization With Inexact Evaluations and Complexity Guarantees

Author

Listed:
  • Shuyao Li

    (University of Wisconsin–Madison)

  • Stephen J. Wright

    (University of Wisconsin–Madison)

Abstract

We consider minimization of a smooth nonconvex function with inexact oracle access to gradient and Hessian (without assuming access to the function value) to achieve approximate second-order optimality. A novel feature of our method is that if an approximate direction of negative curvature is chosen as the step, we choose its sign to be positive or negative with equal probability. We allow gradients to be inexact (with a bound on their error relative to the size of the true quantity) and relax the coupling between inexactness thresholds for the first- and second-order optimality conditions. Our convergence analysis includes both an expectation bound based on martingale analysis and a high-probability bound based on concentration inequalities. We apply our algorithm to empirical risk minimization problems and obtain improved gradient sample complexity over existing works.

Suggested Citation

  • Shuyao Li & Stephen J. Wright, 2025. "A Randomized Algorithm for Nonconvex Minimization With Inexact Evaluations and Complexity Guarantees," Journal of Optimization Theory and Applications, Springer, vol. 207(3), pages 1-27, December.
    • Handle: RePEc:spr:joptap:v:207:y:2025:i:3:d:10.1007_s10957-025-02817-y
    DOI: 10.1007/s10957-025-02817-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-025-02817-y
    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-025-02817-y?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:joptap:v:207:y:2025:i:3:d:10.1007_s10957-025-02817-y. 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.