2016
DOI: 10.1007/s00158-016-1450-1
|View full text |Cite
|
Sign up to set email alerts
|

Multi-start Space Reduction (MSSR) surrogate-based global optimization method

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
28
0

Year Published

2017
2017
2020
2020

Publication Types

Select...
8

Relationship

3
5

Authors

Journals

citations
Cited by 66 publications
(28 citation statements)
references
References 38 publications
0
28
0
Order By: Relevance
“…The most significant collections of global optimization benchmark problems can be found in [18,86,87]. Each benchmark problem has its individual characteristic, such as whether it is a multimodal, a unimodal or a random shape function as illustrated in Figure 1.…”
Section: Benchmark Function and Experiments Materialsmentioning
confidence: 99%
“…The most significant collections of global optimization benchmark problems can be found in [18,86,87]. Each benchmark problem has its individual characteristic, such as whether it is a multimodal, a unimodal or a random shape function as illustrated in Figure 1.…”
Section: Benchmark Function and Experiments Materialsmentioning
confidence: 99%
“…Each of these metamodel techniques has its advantages and disadvantages. Recently, methods for generating hybrid models by combining these metamodels have been developed . We call such hybrid model an ensemble model or multiple surrogates.…”
Section: Introductionmentioning
confidence: 99%
“…Recently, methods for generating hybrid models by combining these metamodels have been developed. [10][11][12][13][14][15][16][17][18][19][20][21] We call such hybrid model an ensemble model or multiple surrogates. The performance of metamodel-based optimization algorithm depends on the reliability of the metamodel.…”
Section: Introductionmentioning
confidence: 99%
“…Multi-start Space Reduction (MSSR) surrogate-based global optimization method is a most recently MBGO method in our research for the applications with black-box and computationally intensive applications (Dong et al [25]). In this new algorithm, the design space is classified into: the original design space or global space (GS), the reduced medium space (MS) that contains the promising region, and the local space (LS) that is a local area surrounding the present best solution in the search.…”
Section: Mssr Algorithmmentioning
confidence: 99%
“…The approach uses limited "expensive" sample data points from the original, computationally expensive optimization model to introduce a surrogate model, or metamodel, such as Kriging [22] and radial basis functions (RBF) [23], and to effectively use the "cheaper" sample points from the metamodel to speed up the search of the global optimum with much reduced number of original model evaluations and computational time. Several reviews have systematically presented the advantages of these algorithms [21,[24][25][26]. The newly introduced algorithms have been compared with other existing GO techniques using about a dozen of standard benchmarks optimization problems to study their capability to accurately locate the global optimum, search efficiency and computation time.…”
Section: Introductionmentioning
confidence: 99%