2009
DOI: 10.1109/tmag.2009.2012750
|View full text |Cite
|
Sign up to set email alerts
|

A New Efficient Method for Global Discrete Multilevel Optimization Combining Branch-and-Bound and Space-Mapping

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0

Year Published

2011
2011
2014
2014

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 14 publications
(11 citation statements)
references
References 7 publications
0
11
0
Order By: Relevance
“…It is important that the surrogate is physically based [10], so that it can give a reliable prediction of the original structure's behavior under the modification of its designable parameters. One of the most successful techniques in microwave engineering exploiting physically based surrogate models is space mapping (SM) [11–20]. SM replaces direct optimization of a CPU‐intensive structure (“fine” model) by iterative optimization and updating of so‐called coarse models that are less accurate but cheaper to evaluate.…”
Section: Introductionmentioning
confidence: 99%
“…It is important that the surrogate is physically based [10], so that it can give a reliable prediction of the original structure's behavior under the modification of its designable parameters. One of the most successful techniques in microwave engineering exploiting physically based surrogate models is space mapping (SM) [11–20]. SM replaces direct optimization of a CPU‐intensive structure (“fine” model) by iterative optimization and updating of so‐called coarse models that are less accurate but cheaper to evaluate.…”
Section: Introductionmentioning
confidence: 99%
“…It has been recently used for solving optimization problems of electromagnetic converters (Encica et al, 2008b;Tran et al, 2009). This technique requires a second model, faster but less accurate, of the device to be optimally sized.…”
Section: Osmmentioning
confidence: 99%
“…4) Algorithm layer: is a factory class containing the optimization algorithms. Evolutionary stands for evolutionary stochastic algorithms [8]; EE for an exhaustive enumeration [4]; BB for a branch-and-bound algorithm [9]; Interval for interval branch-and-bound algorithm [10]. There is a possibility of plugging a third-party algorithm through the API.…”
Section: Structure Of the Environmentmentioning
confidence: 99%
“…3) Branch-and-bound algorithm [9]: Algorithm 2 illustrates the general idea of the method for mono-objective optimization problems. Practically, it is possible to use this algorithm for the multi-objective problems by applying the scalarization techniques (ǫ-constraint, weighted metrics Fig.…”
Section: ) Evolutionary Algorithmmentioning
confidence: 99%