{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T23:37:14Z","timestamp":1773099434873,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T00:00:00Z","timestamp":1747785600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T00:00:00Z","timestamp":1747785600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100021856","name":"Ministero dell\u2019Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","award":["P2022J9SNP"],"award-info":[{"award-number":["P2022J9SNP"]}],"id":[{"id":"10.13039\/501100021856","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100021856","name":"Ministero dell\u2019Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","award":["2022N3ZNAX"],"award-info":[{"award-number":["2022N3ZNAX"]}],"id":[{"id":"10.13039\/501100021856","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004434","name":"Universit\u00e0 degli Studi di Firenze","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100004434","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2025,7]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>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\u2019s 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.<\/jats:p>","DOI":"10.1007\/s10957-025-02704-6","type":"journal-article","created":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T09:10:58Z","timestamp":1747818658000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A discrete Consensus-Based Global Optimization Method with Noisy Objective Function"],"prefix":"10.1007","volume":"206","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3691-7836","authenticated-orcid":false,"given":"Stefania","family":"Bellavia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Greta","family":"Malaspina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,21]]},"reference":[{"key":"2704_CR1","first-page":"8","volume":"8","author":"G Borghi","year":"2023","unstructured":"Borghi, G., Herty, M., Pareschi, L.: An adaptive consensus based method for multi-objective optimization with uniform pareto front approximation. Appl Math Optim 8, 8 (2023)","journal-title":"Appl Math Optim"},{"issue":"1","key":"2704_CR2","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1137\/22M1471304","volume":"33","author":"G Borghi","year":"2023","unstructured":"Borghi, G., Herty, M., Pareschi, L.: Constrained consensus-based optimization. SIAM Journal on Optimization 33(1), 211\u2013236 (2023). https:\/\/doi.org\/10.1137\/22M1471304","journal-title":"SIAM Journal on Optimization"},{"issue":"2","key":"2704_CR3","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/16M1080173","volume":"60","author":"L Bottou","year":"2018","unstructured":"Bottou, L., Curtis, F.E., Nocedal, J.: Optimization methods for large-scale machine learning. SIAM Review 60(2), 223\u2013311 (2018). https:\/\/doi.org\/10.1137\/16M1080173","journal-title":"SIAM Review"},{"key":"2704_CR4","doi-asserted-by":"publisher","first-page":"2969","DOI":"10.1007\/s00500-018-3597-8","volume":"23","author":"A Candelieri","year":"2019","unstructured":"Candelieri, A., Archetti, F.: Global optimization in machine learning: the design of a predictive analytics application. Soft Computing 23, 2969\u20132977 (2019)","journal-title":"Soft Computing"},{"key":"2704_CR5","doi-asserted-by":"publisher","unstructured":"Carrillo, J., Choi, Y., Totzeck, C., Tse, O.: An analytical framework for consensus-based global optimization method. Mathematical Models and Methods in Applied Sciences 28 (2016). https:\/\/doi.org\/10.1142\/S0218202518500276","DOI":"10.1142\/S0218202518500276"},{"key":"2704_CR6","doi-asserted-by":"publisher","unstructured":"Carrillo, J., Jin, S., Li, L., Zhu, Y.: A consensus-based global optimization method for high dimensional machine learning problems. ESAIM: Control, Optimisation and Calculus of Variations 27 (2020). https:\/\/doi.org\/10.1051\/cocv\/2020046","DOI":"10.1051\/cocv\/2020046"},{"issue":"2","key":"2704_CR7","doi-asserted-by":"publisher","first-page":"2007","DOI":"10.1137\/22M1537862","volume":"34","author":"Y Fang","year":"2024","unstructured":"Fang, Y., Na, S., Mahoney, M.W., Kolar, M.: Fully stochastic trust-region sequential quadratic programming for equality-constrained optimization problems. SIAM Journal on Optimization 34(2), 2007\u20132037 (2024)","journal-title":"SIAM Journal on Optimization"},{"issue":"14","key":"2704_CR8","doi-asserted-by":"publisher","first-page":"2725","DOI":"10.1142\/S0218202520500530","volume":"30","author":"M Fornasier","year":"2020","unstructured":"Fornasier, M., Huang, H., Pareschi, L., S\u00fcnnen, P.: Consensus-based optimization on hypersurfaces: Well-posedness and mean-field limit. Mathematical Models and Methods in Applied Sciences 30(14), 2725\u20132751 (2020). https:\/\/doi.org\/10.1142\/S0218202520500530","journal-title":"Mathematical Models and Methods in Applied Sciences"},{"key":"2704_CR9","unstructured":"Fornasier, M., Huang, H., Pareschi, L., Sunnen, P.: Consensus-based optimization on the sphere: Convergence to global minimizers and machine learning. Journal of Machine Learning Research (2021)"},{"issue":"3","key":"2704_CR10","doi-asserted-by":"publisher","first-page":"2973","DOI":"10.1137\/22M1527805","volume":"34","author":"M Fornasier","year":"2024","unstructured":"Fornasier, M., Klock, T., Riedl, K.: Consensus-based optimization methods converge globally. SIAM Journal on Optimization 34(3), 2973\u20133004 (2024). https:\/\/doi.org\/10.1137\/22M1527805","journal-title":"SIAM Journal on Optimization"},{"key":"2704_CR11","unstructured":"Fornasier, M., Sun, L.: Regularity and positivity of solutions of the consensus-based optimization equation: unconditional global convergence. preprint, arXiv:2502.01434 (2025)"},{"key":"2704_CR12","doi-asserted-by":"publisher","unstructured":"Ha, S.Y., Jin, S., Kim, D.: Convergence and error estimates for time-discrete consensus-based optimization algorithms. Numerische Mathematik 147 (2021). https:\/\/doi.org\/10.1007\/s00211-021-01174-y","DOI":"10.1007\/s00211-021-01174-y"},{"issue":"06","key":"2704_CR13","doi-asserted-by":"publisher","first-page":"1071","DOI":"10.1142\/S0218202522500245","volume":"32","author":"D Ko","year":"2022","unstructured":"Ko, D., Ha, S.Y., Jin, S., Kim, D.: Convergence analysis of the discrete consensus-based optimization algorithm with random batch interactions and heterogeneous noises. Mathematical Models and Methods in Applied Sciences 32(06), 1071\u20131107 (2022)","journal-title":"Mathematical Models and Methods in Applied Sciences"},{"key":"2704_CR14","doi-asserted-by":"crossref","unstructured":"Locatelli, M., Schoen, F.: Global optimization: theory, algorithms, and applications. SIAM (2013)","DOI":"10.1137\/1.9781611972672"},{"key":"2704_CR15","doi-asserted-by":"publisher","unstructured":"Massart, P.: Concentration inequalities and model selection. Lecture Notes in Mathematics, Springer 1896 (2003). https:\/\/doi.org\/10.1007\/978-3-540-48503-2","DOI":"10.1007\/978-3-540-48503-2"},{"key":"2704_CR16","unstructured":"Pardalos, P.M., Van\u00a0Thoai, N.: Introduction to Global Optimization. Springer Science & Business Media (2000)"},{"key":"2704_CR17","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1016568309421","volume":"1","author":"KE Parsopoulos","year":"2002","unstructured":"Parsopoulos, K.E., Vrahatis, M.N.: Recent approaches to global optimization problems through particle swarm optimization. Natural Computing 1, 235\u2013306 (2002)","journal-title":"Natural Computing"},{"issue":"01","key":"2704_CR18","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1142\/S0218202517400061","volume":"27","author":"R Pinnau","year":"2017","unstructured":"Pinnau, R., Totzeck, C., Tse, O., Martin, S.: A consensus-based model for global optimization and its mean-field limit. Mathematical Models and Methods in Applied Sciences 27(01), 183\u2013204 (2017). https:\/\/doi.org\/10.1142\/S0218202517400061","journal-title":"Mathematical Models and Methods in Applied Sciences"},{"key":"2704_CR19","doi-asserted-by":"publisher","unstructured":"Rice (Cammeo and Osmancik). UCI Machine Learning Repository (2019). https:\/\/doi.org\/10.24432\/C5MW4Z","DOI":"10.24432\/C5MW4Z"},{"issue":"23","key":"2704_CR20","doi-asserted-by":"publisher","first-page":"17715","DOI":"10.1007\/s00500-020-05030-3","volume":"24","author":"YD Sergeyev","year":"2020","unstructured":"Sergeyev, Y.D., Candelieri, A., Kvasov, D.E., Perego, R.: Safe global optimization of expensive noisy black-box functions in the $$\\delta $$-lipschitz framework. Soft Computing 24(23), 17715\u201317735 (2020)","journal-title":"Soft Computing"},{"key":"2704_CR21","doi-asserted-by":"crossref","unstructured":"Strongin, R., Sergeyev, Y.: Global Optimization with Non-convex Constraints: Sequential and Parallel Algorithms. Springer (2000)","DOI":"10.1007\/978-1-4615-4677-1"},{"key":"2704_CR22","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s10898-008-9354-2","volume":"44","author":"J Villemonteix","year":"2009","unstructured":"Villemonteix, J., Vazquez, E., Walter, E.: An informational approach to the global optimization of expensive-to-evaluate functions. Journal of Global Optimization 44, 509\u2013534 (2009)","journal-title":"Journal of Global Optimization"},{"key":"2704_CR23","unstructured":"Zhigljavsky, A., \u017dilinskas, A.: Stochastic Global Optimization. Springer (2008)"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-025-02704-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-025-02704-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-025-02704-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T13:51:51Z","timestamp":1748613111000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-025-02704-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,21]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["2704"],"URL":"https:\/\/doi.org\/10.1007\/s10957-025-02704-6","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,21]]},"assertion":[{"value":"13 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 May 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"20"}}