2019
DOI: 10.1016/j.cma.2018.12.033
|View full text |Cite
|
Sign up to set email alerts
|

pBO-2GP-3B: A batch parallel known/unknown constrained Bayesian optimization with feasibility classification and its applications in computational fluid dynamics

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
26
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
5
3
1

Relationship

1
8

Authors

Journals

citations
Cited by 63 publications
(26 citation statements)
references
References 29 publications
0
26
0
Order By: Relevance
“…In fact, the described extension is similar to Bayesian optimization approaches that account for unknown constraints using classification methods, see for example Sacher et al (2018), Heese et al (2019) and Tran et al (2019).…”
Section: Avoid Queries In Regions Out Of Scopementioning
confidence: 99%
“…In fact, the described extension is similar to Bayesian optimization approaches that account for unknown constraints using classification methods, see for example Sacher et al (2018), Heese et al (2019) and Tran et al (2019).…”
Section: Avoid Queries In Regions Out Of Scopementioning
confidence: 99%
“…It approximates the optimal solution of the real problem as quickly as possible through a limited number of evaluations. Therefore, BO is now used not only for various expensive machine learning problems [31,32] but also gradually for time-consuming simulation-based mechanical optimization design problems [33,34], such as the optimization of impeller shapes [35]. After the surrogate model of the actual function is constructed using the Gaussian process as shown in Figure 5, we actively query the optimal solution of the model by minimizing the acquisition function, which is composed of the predicted mean and predicted standard deviation of the Gaussian model, as shown in Figure 6 is the expected improvement (EI) [36] acquisition function.…”
Section: Beginmentioning
confidence: 99%
“…The penalty function [61] is used to handle constraints in this example. For unknown or computationally expensive constraints, surrogates of constraints can also be constructed to quickly identify the infeasible solutions [23]. Each of the five approaches is run 10 times for this problem.…”
Section: An Engineeringmentioning
confidence: 99%
“…Commonly used acquisition functions include expected improvement (EI) [13,14], probability of improvement (PI) [15,16], and lower confidence bound (LCB) [17,18], where uncertainty associated with the predicted objective values from the surrogates is considered. BO has been studied for a wide range of applications, such as robotics [19,20], combinatorial optimization [21], machine learning [22], simulation-based design optimization [23,24], and others.…”
Section: Introductionmentioning
confidence: 99%