A constrained, globalized, and bounded Nelder-Mead method for engineering optimization

Abstract : One of the fundamental difficulties in engineering design is the multiplicity of local solutions. This has triggered much effort in the development of global search algorithms. Globality, however, often has a prohibitively high numerical cost for real problems. A fixed cost local search, which sequentially becomes global, is developed in this work. Globalization is achieved by probabilistic restarts. A spacial probability of starting a local search is built based on past searches. An improved Nelder-Mead algorithm is the local optimizer. It accounts for variable bounds and nonlinear inequality constraints. It is additionally made more robust by reinitializing degenerated simplexes. The resulting method, called the Globalized Bounded Nelder-Mead (GBNM) algorithm, is particularly adapted to tackling multimodal, discontinuous, constrained optimization problems, for which it is uncertain that a global optimization can be afforded. Numerical experiments are given on two analytical test functions and two composite laminate design problems. The GBNM method compares favorably with an evolutionary algorithm, both in terms of numerical cost and accuracy.
Type de document :
Article dans une revue
Structural and Multidisciplinary Optimization, Springer Verlag (Germany), 2004, Volume 27 (Issue 1), p 43 - 54. 〈10.1007/s00158-003-0320-9〉
Liste complète des métadonnées

https://hal-emse.ccsd.cnrs.fr/emse-00686916
Contributeur : Florent Breuil <>
Soumis le : mercredi 11 avril 2012 - 16:12:32
Dernière modification le : mardi 17 octobre 2017 - 12:08:01

Lien texte intégral

Identifiants

Citation

M.A. Luersen, Rodolphe Le Riche, F. Guyon. A constrained, globalized, and bounded Nelder-Mead method for engineering optimization. Structural and Multidisciplinary Optimization, Springer Verlag (Germany), 2004, Volume 27 (Issue 1), p 43 - 54. 〈10.1007/s00158-003-0320-9〉. 〈emse-00686916〉

Partager

Métriques

Consultations de la notice

108