Proceedings of the Third International Conference on Engineering Computational Technology
DOI: 10.4203/ccp.76.65
|View full text |Cite
|
Sign up to set email alerts
|

Globalized Nelder-Mead Method for Engineering Optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
96
0
6

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 63 publications
(102 citation statements)
references
References 9 publications
0
96
0
6
Order By: Relevance
“…However, from a numerical point of view, solving the multi-objective problem (1) is much more complex than solving the constrained single objective problem (2). State-of-the-art multiobjective algorithms are evolutionary algorithms (see [14] for a review) which have a slower convergence than other single objective algorithms such as the Globalized and Bounded Nelder-Mead algorithm (see Section 2.4 and [15]). Furthermore, the set of solutions need to be post-processed in order to decide which compromise should be manufactured.…”
Section: Design Formulation 21 Structural and Rtcm Couplings In Compmentioning
confidence: 99%
See 1 more Smart Citation
“…However, from a numerical point of view, solving the multi-objective problem (1) is much more complex than solving the constrained single objective problem (2). State-of-the-art multiobjective algorithms are evolutionary algorithms (see [14] for a review) which have a slower convergence than other single objective algorithms such as the Globalized and Bounded Nelder-Mead algorithm (see Section 2.4 and [15]). Furthermore, the set of solutions need to be post-processed in order to decide which compromise should be manufactured.…”
Section: Design Formulation 21 Structural and Rtcm Couplings In Compmentioning
confidence: 99%
“…The constrained single objective optimization problems are dealt with by the Globalized and Bounded Nelder-Mead algorithm ( [15]), GBNM. This algorithm is based on repeated direct Nelder-Mead (sometimes also called simplex, [17]) searches, which work on continuous variables, do not need gradient information and, individually, converge faster than probabilistic global search methods such as evolutionary algorithms ( [18]).…”
Section: The Globalized and Bounded Nelder-mead Optimization Algorithmmentioning
confidence: 99%
“…The local search is performed using Sequential Quadratic Programming (SQP) [15], but the global optimization strategy remains unchanged if another local search algorithm is employed. The search is then turned into an asymptotically global one applying the probabilistic restart procedure proposed by Luersen and Le Riche [13].…”
Section: Local-restart Strategy For Global Optimizationmentioning
confidence: 99%
“…Local search is performed by gradient based techniques and thus local optimality is guaranteed. In order to find the global minimum, the local search is made global by a probabilistic restart procedure presented by Luersen and Le Riche [13]. In this approach, a spatial probability of starting a local search is built based on past searches.…”
Section: Introductionmentioning
confidence: 99%
“…The improvements of the modified NM are summarized as follows: 1 Initialization and boundary. A simplex of size l is initialized at x 0 based on the rule (Luresen and Riche, 2004):…”
Section: End Loopmentioning
confidence: 99%