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

A discrete Consensus-Based Global Optimization Method with Noisy Objective Function

Author

Listed:
  • Stefania Bellavia

    (Università degli Studi di Firenze)

  • Greta Malaspina

    (Università degli Studi di Firenze)

Abstract

Consensus based optimization is a derivative-free particles-based method for the solution of global optimization problems. Several versions of the method have been proposed in the literature, and different convergence results have been proved. However, all existing results assume the objective function to be evaluated exactly at each iteration of the method. In this work, we extend the convergence analysis of a discrete-time CBO method to the case where only a noisy stochastic estimator of the objective function can be computed at a given point. In particular we prove that under suitable assumptions on the oracle’s noise, the expected value of the mean squared distance of the particles from the solution can be made arbitrarily small in a finite number of iterations. Numerical experiments showing the impact of noise are also given.

Suggested Citation

  • Stefania Bellavia & Greta Malaspina, 2025. "A discrete Consensus-Based Global Optimization Method with Noisy Objective Function," Journal of Optimization Theory and Applications, Springer, vol. 206(1), pages 1-40, July.
    • Handle: RePEc:spr:joptap:v:206:y:2025:i:1:d:10.1007_s10957-025-02704-6
    DOI: 10.1007/s10957-025-02704-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-025-02704-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-025-02704-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:206:y:2025:i:1:d:10.1007_s10957-025-02704-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.