2010
DOI: 10.1007/978-3-642-10701-6_6
|View full text |Cite
|
Sign up to set email alerts
|

Kriging Is Well-Suited to Parallelize Optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
189
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
6
1
1

Relationship

2
6

Authors

Journals

citations
Cited by 269 publications
(209 citation statements)
references
References 31 publications
0
189
0
Order By: Relevance
“…With the availability of parallel computing becoming commonplace, formulation of multiple update infill criteria has received further attention in recent years (Henkenjohann and Kunert 2007, Ponweiser et al 2008, Viana and Haftka 2010b. Most recently, Ginsbourger et al (2010) have provided an extension to Schonlau's early work by providing a sound analytical expression for finding multiple updates based on the expected improvement. This expression becomes mathematically intractable beyond two updates at each iteration and relies on expensive statistical methods such as Monte Carlo simulations for a higher number of multiple updates.…”
Section: Introductionmentioning
confidence: 97%
“…With the availability of parallel computing becoming commonplace, formulation of multiple update infill criteria has received further attention in recent years (Henkenjohann and Kunert 2007, Ponweiser et al 2008, Viana and Haftka 2010b. Most recently, Ginsbourger et al (2010) have provided an extension to Schonlau's early work by providing a sound analytical expression for finding multiple updates based on the expected improvement. This expression becomes mathematically intractable beyond two updates at each iteration and relies on expensive statistical methods such as Monte Carlo simulations for a higher number of multiple updates.…”
Section: Introductionmentioning
confidence: 97%
“…Coming back to the decision-theoretic roots of EI [5], a Multi-points Expected Improvement (also called "q-EI") criterion for batch-sequential optimization was defined in [6] and further developed in [7,8]. Maximizing this criterion enables choosing batches of q > 1 points at which to evaluate f in parallel, and is of particular interest in the frequent case where several CPUs are simultaneously available.…”
Section: Introductionmentioning
confidence: 99%
“…Maximizing this criterion enables choosing batches of q > 1 points at which to evaluate f in parallel, and is of particular interest in the frequent case where several CPUs are simultaneously available. Even though an analytical formula was derived for the 2-EI in [7], the Monte Carlo (MC) approach of [8] for computing q-EI when q ≥ 3 makes the criterion itself expensive-to-evaluate, and particularly hard to optimize.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Note that in the example above, the two designs of experiments are generated independently of each other. In practice, however, one rather needs to augment an existing design with new well-chosen points, be it in a sequential (one point after the other, like in [18]) or in a batch-sequential manner [14].…”
mentioning
confidence: 99%