Preprint · 2024 · Open access
Constrained Bayesian optimization with merit functions
arXiv (Cornell University) · Published 19 March 2024 · DOI 10.48550/arxiv.2403.13140
In brief
“Constrained Bayesian optimization with merit functions” is a 2024 preprint by Jincheng Wang and 2 co-authors, published in arXiv (Cornell University). OpenAlex counts 4 citations as of 19 November 2026. It is open access under a CC BY licence: the full text is free to read at arXiv (Cornell University).
- Citations
- 4
- Most cited in
- 2024 (2)
- References
- 24
- Authors
- 3
Abstract
Bayesian optimization is a powerful optimization tool for problems where native first-order derivatives are unavailable. Recently, constrained Bayesian optimization (CBO) has been applied to many engineering applications where constraints are essential. However, several obstacles remain with current CBO algorithms that could prevent a wider adoption. We propose CBO algorithms using merit functions, such as the penalty merit function, in acquisition functions, inspired by nonlinear optimization methods, e.g., sequential quadratic programming. Merit functions measure the potential progress of both the objective and constraint functions, thus increasing algorithmic efficiency and allowing infeasible initial samples. The acquisition functions with merit functions are relaxed to have closed forms, making its implementation readily available wherever Bayesian optimization is. We further propose a unified CBO algorithm that can be seen as extension to the popular expected constrained improvement (ECI) approach. We demonstrate the effectiveness and efficiency of the proposed algorithms through numerical experiments on synthetic problems and a practical data-driven engineering design problem in the field of plasma physics.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Wang, J., Petra, C. G., & Peterson, J. L. (2024). Constrained Bayesian optimization with merit functions. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2403.13140
MLA 9
Wang, Jincheng, et al. “Constrained Bayesian optimization with merit functions.” arXiv (Cornell University), 2024. https://doi.org/10.48550/arxiv.2403.13140.
Chicago
Wang, Jincheng, Cosmin G. Petra, and J. L. Peterson. 2024. “Constrained Bayesian optimization with merit functions.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.2403.13140.
Harvard
Wang, J., Petra, C. G. and Peterson, J. L. (2024) ‘Constrained Bayesian optimization with merit functions’, arXiv (Cornell University). doi:10.48550/arxiv.2403.13140.
IEEE
J. Wang, C. G. Petra, and J. L. Peterson, “Constrained Bayesian optimization with merit functions,” arXiv (Cornell University), 2024, doi: 10.48550/arxiv.2403.13140.
BibTeX
@misc{wang2024constrained,
title = {{Constrained Bayesian optimization with merit functions}},
author = {Wang, Jincheng and Petra, Cosmin G. and Peterson, J. L.},
howpublished = {arXiv (Cornell University)},
year = {2024},
doi = {10.48550/arxiv.2403.13140},
url = {https://doi.org/10.48550/arxiv.2403.13140}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Bandit Algorithms Research
- constrained Bayesian optimization
- merit function
- acquisition functions
- sequential quadratic programming
- plasma physics
Work with this paper
Most-cited papers in Decision Sciences
- The PRISMA 2020 statement: an updated guideline for reporting systematic reviewsMatthew James Page, Joanne E. McKenzie, Patrick M. Bossuyt and 23 more · BMJ · 2021 · 144,919 citations
- Evaluating Structural Equation Models with Unobservable Variables and Measurement ErrorClaes Fornell, David F. Larcker · Journal of Marketing Research · 1981 · 118,336 citations
- Cutoff criteria for fit indexes in covariance structure analysis: Conventional criteria versus new alternativesLi‐tze Hu, Peter M. Bentler · Structural Equation Modeling A Multidisciplinary Journal · 1999 · 117,461 citations
- Common method biases in behavioral research: A critical review of the literature and recommended remedies.Philip M. Podsakoff, SCOTT B. MACKENZIE, Jeong Yeon Lee and 1 more · Journal of Applied Psychology · 2003 · 89,248 citations
- Preferred reporting items for systematic reviews and meta-analyses: the PRISMA statementDavid Moher, Alessandro Liberati, Jennifer Tetzlaff and 2 more · BMJ · 2009 · 85,524 citations
Questions about this paper
How do I cite this paper in APA style?
Wang, J., Petra, C. G., & Peterson, J. L. (2024). Constrained Bayesian optimization with merit functions. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2403.13140
How many times has this paper been cited?
4 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 arXiv (Cornell University): sign in and open the PDF from this page.
Who wrote this paper?
Jincheng Wang, Cosmin G. Petra, J. L. Peterson.
What is the DOI of this paper?
10.48550/arxiv.2403.13140, permanently at https://doi.org/10.48550/arxiv.2403.13140. 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.