Journal article · 2022 · Open access
Constrained robust Bayesian optimization of expensive noisy black‐box functions with guaranteed regret bounds
AIChE Journal, 68(12) · Published 9 August 2022 · DOI 10.1002/aic.17857
In brief
“Constrained robust Bayesian optimization of expensive noisy black‐box functions with guaranteed regret bounds” is a 2022 journal article by Akshay Kudva and 2 co-authors, published in AIChE Journal. OpenAlex counts 20 citations as of 19 November 2026, which puts it in the top 7% of works published in 2022 by citations. It is open access under a CC BY licence: the full text is free to read at AIChE Journal.
- Citations
- 20
- Most cited in
- 2026 (8)
- Field-weighted impact
- 1.44
- References
- 67
- Authors
- 3
Abstract
Many real‐world design problems involve optimization of expensive black‐box functions. Bayesian optimization (BO) is a promising approach for solving such challenging problems using probabilistic surrogate models to systematically tradeoff between exploitation and exploration of the design space. Although BO is often applied to unconstrained problems, it has recently been extended to the constrained setting. Current constrained BO methods, however, cannot identify solutions that are robust to unavoidable uncertainties. In this article, we propose a robust constrained BO method, constrained adversarially robust Bayesian optimization (CARBO), that addresses this challenge by jointly modeling the effect of the design variables and uncertainties on the unknown functions. Using exact penalty functions, we establish a bound on the number of CARBO iterations required to find a near‐global robust solution and provide a rigorous proof of convergence. The advantages of CARBO are demonstrated on two case studies including a non‐convex benchmark problem and a realistic bubble column reactor design problem.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Kudva, A., Sorourifar, F., & Paulson, J. A. (2022). Constrained robust Bayesian optimization of expensive noisy black‐box functions with guaranteed regret bounds. AIChE Journal, 68(12). https://doi.org/10.1002/aic.17857
MLA 9
Kudva, Akshay, et al. “Constrained robust Bayesian optimization of expensive noisy black‐box functions with guaranteed regret bounds.” AIChE Journal, vol. 68, no. 12, 2022. https://doi.org/10.1002/aic.17857.
Chicago
Kudva, Akshay, Farshud Sorourifar, and Joel A. Paulson. 2022. “Constrained robust Bayesian optimization of expensive noisy black‐box functions with guaranteed regret bounds.” AIChE Journal 68 (12). https://doi.org/10.1002/aic.17857.
Harvard
Kudva, A., Sorourifar, F. and Paulson, J. A. (2022) ‘Constrained robust Bayesian optimization of expensive noisy black‐box functions with guaranteed regret bounds’, AIChE Journal, 68(12). doi:10.1002/aic.17857.
IEEE
A. Kudva, F. Sorourifar, and J. A. Paulson, “Constrained robust Bayesian optimization of expensive noisy black‐box functions with guaranteed regret bounds,” AIChE Journal, vol. 68, no. 12, 2022, doi: 10.1002/aic.17857.
BibTeX
@article{kudva2022constrained,
title = {{Constrained robust Bayesian optimization of expensive noisy black‐box functions with guaranteed regret bounds}},
author = {Kudva, Akshay and Sorourifar, Farshud and Paulson, Joel A.},
journal = {AIChE Journal},
year = {2022},
volume = {68},
number = {12},
doi = {10.1002/aic.17857},
url = {https://doi.org/10.1002/aic.17857}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2023 | 4 | |
| 2024 | 5 | |
| 2025 | 3 | |
| 2026 | 8 |
Its field-weighted citation impact is 1.44: it has been cited 1.44 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Bandit Algorithms Research
- constrained Bayesian optimization
- adversarial robustness
- expensive black-box functions
- noisy functions
- regret bounds
- exact penalty function
- convergence analysis
- surrogate models
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?
Kudva, A., Sorourifar, F., & Paulson, J. A. (2022). Constrained robust Bayesian optimization of expensive noisy black‐box functions with guaranteed regret bounds. AIChE Journal, 68(12). https://doi.org/10.1002/aic.17857
How many times has this paper been cited?
20 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 AIChE Journal: sign in and open the PDF from this page.
Who wrote this paper?
Akshay Kudva, Farshud Sorourifar, Joel A. Paulson.
What is the DOI of this paper?
10.1002/aic.17857, permanently at https://doi.org/10.1002/aic.17857. 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.