Journal article · 2025 · Open access

A Bi-Objective Optimization Based Acquisition Strategy for Batch Bayesian Global Optimization

Francesco Carciaghi, Simone Magistri, Pierluigi Mansueto, Fabio Schoen

Computational Optimization and Applications, 92(1), 81–123 · Published 23 May 2025 · DOI 10.1007/s10589-025-00696-7

Open PDFView at the publisherCite this paper

In brief

“A Bi-Objective Optimization Based Acquisition Strategy for Batch Bayesian Global Optimization” is a 2025 journal article by Francesco Carciaghi and 3 co-authors, published in Computational Optimization and Applications. OpenAlex counts 5 citations as of 19 November 2026, which puts it in the top 3% of works published in 2025 by citations. It is open access under a CC BY licence: the full text is free to read at Computational Optimization and Applications.

Citations
5
Most cited in
2026 (5)
Field-weighted impact
2.16
References
75
Authors
4

Abstract

In this paper we deal with batch Bayesian Optimization (Bayes-Opt) problems over a box. Bayes-Opt approaches find their main applications when the objective function is very expensive to evaluate. Sometimes, given the availability of multi-processor computing architectures, function evaluation might be performed in parallel in order to lower the clock-time of the overall computation. This paper fits this situation and is devoted to the development of a novel bi-objective optimization (BOO) acquisition strategy to sample batches of points where to evaluate the objective function. The BOO problem involves the Gaussian Process posterior mean and variance functions, which, in most of the acquisition strategies from the literature, are generally used in combination, frequently through scalarization. However, such scalarization could compromise the Bayes-Opt process performance, as getting the desired trade-off between exploration and exploitation is not trivial in most cases. We instead aim to reconstruct the Pareto front of the BOO problem exploiting first order information of the posterior mean and variance, thus generating multiple trade-offs of the two functions without any a priori knowledge. The algorithm used for the reconstruction is the Non-dominated Sorting Memetic Algorithm (NSMA), recently proposed in the literature and proved to be effective in solving hard MOO problems. Finally, we present two clustering approaches, each of them operating on a different space, to select potentially optimal points from the Pareto front. We compare our methodology with well-known acquisition strategies from the literature, showing its effectiveness on a wide set of experiments.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Carciaghi, F., Magistri, S., Mansueto, P., & Schoen, F. (2025). A Bi-Objective Optimization Based Acquisition Strategy for Batch Bayesian Global Optimization. Computational Optimization and Applications, 92(1), 81–123. https://doi.org/10.1007/s10589-025-00696-7

MLA 9

Carciaghi, Francesco, et al. “A Bi-Objective Optimization Based Acquisition Strategy for Batch Bayesian Global Optimization.” Computational Optimization and Applications, vol. 92, no. 1, 2025, pp. 81–123. https://doi.org/10.1007/s10589-025-00696-7.

Chicago

Carciaghi, Francesco, Simone Magistri, Pierluigi Mansueto, and Fabio Schoen. 2025. “A Bi-Objective Optimization Based Acquisition Strategy for Batch Bayesian Global Optimization.” Computational Optimization and Applications 92 (1): 81–123. https://doi.org/10.1007/s10589-025-00696-7.

Harvard

Carciaghi, F. et al. (2025) ‘A Bi-Objective Optimization Based Acquisition Strategy for Batch Bayesian Global Optimization’, Computational Optimization and Applications, 92(1), pp. 81–123. doi:10.1007/s10589-025-00696-7.

IEEE

F. Carciaghi, S. Magistri, P. Mansueto, and F. Schoen, “A Bi-Objective Optimization Based Acquisition Strategy for Batch Bayesian Global Optimization,” Computational Optimization and Applications, vol. 92, no. 1, pp. 81–123, 2025, doi: 10.1007/s10589-025-00696-7.

BibTeX

@article{carciaghi2025objective,
  title     = {{A Bi-Objective Optimization Based Acquisition Strategy for Batch Bayesian Global Optimization}},
  author    = {Carciaghi, Francesco and Magistri, Simone and Mansueto, Pierluigi and Schoen, Fabio},
  journal   = {Computational Optimization and Applications},
  year      = {2025},
  volume    = {92},
  number    = {1},
  pages     = {81--123},
  doi       = {10.1007/s10589-025-00696-7},
  url       = {https://doi.org/10.1007/s10589-025-00696-7}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Topic and keywords

Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Multi-Objective Optimization Algorithms

  • batch Bayesian optimization
  • bi-objective optimization
  • acquisition strategy
  • Gaussian processes
  • exploration-exploitation balance
  • NSGA-II
  • multi-objective optimization
  • clustering

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Carciaghi, F., Magistri, S., Mansueto, P., & Schoen, F. (2025). A Bi-Objective Optimization Based Acquisition Strategy for Batch Bayesian Global Optimization. Computational Optimization and Applications, 92(1), 81–123. https://doi.org/10.1007/s10589-025-00696-7

How many times has this paper been cited?

5 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access at Computational Optimization and Applications: sign in and open the PDF from this page.

Who wrote this paper?

Francesco Carciaghi, Simone Magistri, Pierluigi Mansueto, Fabio Schoen.

What is the DOI of this paper?

10.1007/s10589-025-00696-7, permanently at https://doi.org/10.1007/s10589-025-00696-7. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.