Journal article · 2026 · Open access

Penalization method to convert Bayesian optimization methods into batch multi-objective Bayesian optimization methods

Adelle Holder, Henry DeBruin, Jesse M. Sestito

PLoS ONE, 21(7), e0354346 · Published 21 July 2026 · DOI 10.1371/journal.pone.0354346

Open PDFView at the publisherCite this paper

In brief

“Penalization method to convert Bayesian optimization methods into batch multi-objective Bayesian optimization methods” is a 2026 journal article by Adelle Holder and 2 co-authors, published in PLoS ONE. OpenAlex counts 0 citations as of 19 November 2026. It is open access under a CC BY licence: the full text is free to read at PLoS ONE.

Citations
0
References
44
Authors
3

Abstract

Bayesian optimization is a surrogate-based global optimization method that is increasingly being used for engineering design. However, most methods are designed to be sequential, and in optimization problems where the functional evaluation can be easily parallelized, batch methods are more effective at reducing real-time computation. While existing batch multi-objective Bayesian optimization (B-MOBO) methods achieve strong performance, they are typically purpose-built from scratch, limiting ability to leverage the extensive library of proven sequential acquisition functions for parallel settings. In this paper, a generalizable transformation methodology is developed that converts compatible single- or multi-objective sequential Bayesian optimization methods into B-MOBO methods. The key innovation is a Euclidean distance-based composite acquisition function with multi-objective penalization averaging, which combines multiple sequential acquisition functions while incorporating objective-wise penalization information from all objectives and preventing redundant sampling in batch selection. To demonstrate the schema, this methodology is applied to two representative sequential acquisition strategies, the expected improvement method (single-objective) and the quality metrics method (multi-objective), to develop two new B-MOBO variants. These new methods are then compared against their sequential counterparts and established B-MOBO methods using both computation time and real-time analysis. Results show that the new B-MOBO methods are as effective as existing methods at solving optimization problems in terms of solution quality and show improvements when real-time is considered.

Cite this paper

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

APA 7

Holder, A., DeBruin, H., & Sestito, J. M. (2026). Penalization method to convert Bayesian optimization methods into batch multi-objective Bayesian optimization methods. PLoS ONE, 21(7), e0354346. https://doi.org/10.1371/journal.pone.0354346

MLA 9

Holder, Adelle, et al. “Penalization method to convert Bayesian optimization methods into batch multi-objective Bayesian optimization methods.” PLoS ONE, vol. 21, no. 7, 2026, p. e0354346. https://doi.org/10.1371/journal.pone.0354346.

Chicago

Holder, Adelle, Henry DeBruin, and Jesse M. Sestito. 2026. “Penalization method to convert Bayesian optimization methods into batch multi-objective Bayesian optimization methods.” PLoS ONE 21 (7): e0354346. https://doi.org/10.1371/journal.pone.0354346.

Harvard

Holder, A., DeBruin, H. and Sestito, J. M. (2026) ‘Penalization method to convert Bayesian optimization methods into batch multi-objective Bayesian optimization methods’, PLoS ONE, 21(7), p. e0354346. doi:10.1371/journal.pone.0354346.

IEEE

A. Holder, H. DeBruin, and J. M. Sestito, “Penalization method to convert Bayesian optimization methods into batch multi-objective Bayesian optimization methods,” PLoS ONE, vol. 21, no. 7, p. e0354346, 2026, doi: 10.1371/journal.pone.0354346.

BibTeX

@article{holder2026penalization,
  title     = {{Penalization method to convert Bayesian optimization methods into batch multi-objective Bayesian optimization methods}},
  author    = {Holder, Adelle and DeBruin, Henry and Sestito, Jesse M.},
  journal   = {PLoS ONE},
  year      = {2026},
  volume    = {21},
  number    = {7},
  pages     = {e0354346},
  doi       = {10.1371/journal.pone.0354346},
  url       = {https://doi.org/10.1371/journal.pone.0354346}
}

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

  • Bayesian optimization
  • penalty method
  • acquisition functions
  • Euclidean distance
  • expected improvement
  • surrogate-based optimization
  • parallel evaluation
  • real-time processing

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?

Holder, A., DeBruin, H., & Sestito, J. M. (2026). Penalization method to convert Bayesian optimization methods into batch multi-objective Bayesian optimization methods. PLoS ONE, 21(7), e0354346. https://doi.org/10.1371/journal.pone.0354346

How many times has this paper been cited?

0 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 PLoS ONE: sign in and open the PDF from this page.

Who wrote this paper?

Adelle Holder, Henry DeBruin, Jesse M. Sestito.

What is the DOI of this paper?

10.1371/journal.pone.0354346, permanently at https://doi.org/10.1371/journal.pone.0354346. 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.