IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v73y2025i3p1535-1557.html
   My bibliography  Save this article

Quantile Optimization via Multiple-Timescale Local Search for Black-Box Functions

Author

Listed:
  • Jiaqiao Hu

    (Department of Applied Mathematics and Statistics, State University of New York at Stony Brook, Stony Brook, New York 11794)

  • Meichen Song

    (Department of Applied Mathematics and Statistics, State University of New York at Stony Brook, Stony Brook, New York 11794)

  • Michael C. Fu

    (Robert H. Smith School of Business, University of Maryland, College Park, Maryland 20742; and Institute for Systems Research, University of Maryland, College Park, Maryland 20742)

Abstract

We consider quantile optimization of black-box functions that are estimated with noise. We propose two new iterative three-timescale local search algorithms. The first algorithm uses an appropriately modified finite-difference-based gradient estimator that requires 2 d + 1 samples of the black-box function per iteration of the algorithm, where d is the number of decision variables (dimension of the input vector). For higher-dimensional problems, this algorithm may not be practical if the black-box function estimates are expensive. The second algorithm employs a simultaneous-perturbation-based gradient estimator that uses only three samples for each iteration regardless of problem dimension. Under appropriate conditions, we show the almost sure convergence of both algorithms. In addition, for the class of strongly convex functions, we further establish their (finite-time) convergence rate through a novel fixed-point argument. Simulation experiments indicate that the algorithms work well on a variety of test problems and compare well with recently proposed alternative methods.

Suggested Citation

  • Jiaqiao Hu & Meichen Song & Michael C. Fu, 2025. "Quantile Optimization via Multiple-Timescale Local Search for Black-Box Functions," Operations Research, INFORMS, vol. 73(3), pages 1535-1557, May.
  • Handle: RePEc:inm:oropre:v:73:y:2025:i:3:p:1535-1557
    DOI: 10.1287/opre.2022.0534
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2022.0534
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.2022.0534?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
    ---><---

    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:inm:oropre:v:73:y:2025:i:3:p:1535-1557. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.