Preprint · 2020 · Open access
srMO-BO-3GP: A sequential regularized multi-objective constrained Bayesian optimization for design applications
arXiv (Cornell University) · Published 7 July 2020 · DOI 10.48550/arxiv.2007.03502
In brief
“srMO-BO-3GP: A sequential regularized multi-objective constrained Bayesian optimization for design applications” is a 2020 preprint by Anh Tuan Tran and 3 co-authors, published in arXiv (Cornell University). OpenAlex counts 4 citations as of 18 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).
- Citations
- 4
- Most cited in
- 2021 (2)
- References
- 52
- Authors
- 4
Abstract
Bayesian optimization (BO) is an efficient and flexible global optimization framework that is applicable to a very wide range of engineering applications. To leverage the capability of the classical BO, many extensions, including multi-objective, multi-fidelity, parallelization, latent-variable model, have been proposed to improve the limitation of the classical BO framework. In this work, we propose a novel multi-objective (MO) extension, called srMO-BO-3GP, to solve the MO optimization problems in a sequential setting. Three different Gaussian processes (GPs) are stacked together, where each of the GP is assigned with a different task: the first GP is used to approximate the single-objective function, the second GP is used to learn the unknown constraints, and the third GP is used to learn the uncertain Pareto frontier. At each iteration, a MO augmented Tchebycheff function converting MO to single-objective is adopted and extended with a regularized ridge term, where the regularization is introduced to smoothen the single-objective function. Finally, we couple the third GP along with the classical BO framework to promote the richness and diversity of the Pareto frontier by the exploitation and exploration acquisition function. The proposed framework is demonstrated using several numerical benchmark functions, as well as a thermomechanical finite element model for flip-chip package design optimization.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Tran, A. T., Eldred, M., McCann, S. R., & Wang, Y. (2020). srMO-BO-3GP: A sequential regularized multi-objective constrained Bayesian optimization for design applications. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2007.03502
MLA 9
Tran, Anh Tuan, et al. “srMO-BO-3GP: A sequential regularized multi-objective constrained Bayesian optimization for design applications.” arXiv (Cornell University), 2020. https://doi.org/10.48550/arxiv.2007.03502.
Chicago
Tran, Anh Tuan, Mike Eldred, Scott R. McCann, and Yan Wang. 2020. “srMO-BO-3GP: A sequential regularized multi-objective constrained Bayesian optimization for design applications.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.2007.03502.
Harvard
Tran, A. T. et al. (2020) ‘srMO-BO-3GP: A sequential regularized multi-objective constrained Bayesian optimization for design applications’, arXiv (Cornell University). doi:10.48550/arxiv.2007.03502.
IEEE
A. T. Tran, M. Eldred, S. R. McCann, and Y. Wang, “srMO-BO-3GP: A sequential regularized multi-objective constrained Bayesian optimization for design applications,” arXiv (Cornell University), 2020, doi: 10.48550/arxiv.2007.03502.
BibTeX
@misc{tran2020srmo,
title = {{srMO-BO-3GP: A sequential regularized multi-objective constrained Bayesian optimization for design applications}},
author = {Tran, Anh Tuan and Eldred, Mike and McCann, Scott R. and Wang, Yan},
howpublished = {arXiv (Cornell University)},
year = {2020},
doi = {10.48550/arxiv.2007.03502},
url = {https://doi.org/10.48550/arxiv.2007.03502}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2021 | 2 | |
| 2022 | 1 | |
| 2024 | 1 |
Topic and keywords
Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Multi-Objective Optimization Algorithms
- multi-objective Bayesian optimization
- constrained Bayesian optimization
- sequential optimization
- constraint learning
- Tikhonov regularization
- acquisition functions
- thermo-mechanical finite element model
- design optimization
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Tran, A. T., Eldred, M., McCann, S. R., & Wang, Y. (2020). srMO-BO-3GP: A sequential regularized multi-objective constrained Bayesian optimization for design applications. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2007.03502
How many times has this paper been cited?
4 times, according to OpenAlex on 18 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?
Anh Tuan Tran, Mike Eldred, Scott R. McCann, Yan Wang.
What is the DOI of this paper?
10.48550/arxiv.2007.03502, permanently at https://doi.org/10.48550/arxiv.2007.03502. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 18 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.