Two new variants of the manifold‐mapping technique
| Autor: | David Echeverria |
|---|---|
| Rok vydání: | 2007 |
| Předmět: |
Scheme (programming language)
Mathematical optimization Engineering Electromagnetics Optimization problem business.industry Applied Mathematics Space mapping Manifold Computer Science Applications Set (abstract data type) Range (mathematics) Computational Theory and Mathematics Electrical and Electronic Engineering business computer computer.programming_language MM algorithm |
| Zdroj: | COMPEL - The international journal for computation and mathematics in electrical and electronic engineering. 26:334-344 |
| ISSN: | 0332-1649 |
| DOI: | 10.1108/03321640710727692 |
| Popis: | PurposeManifold‐mapping (MM) is an efficient surrogate‐based optimization technique aimed at the acceleration of very time‐consuming design problems. In this paper we present two new variants of the original algorithm that make it applicable to a broader range of optimization scenarios.Design/methodology/approachThe first variant is useful when the optimization constraints are expressed by means of functions that are very expensive to compute. The second variant endows the original scheme with a trust‐region strategy and the result is a much more robust algorithm.FindingsTwo practical optimization problems from electromagnetics eventually show that the proposed variants perform efficiently.Originality/valueThe original MM algorithm is extended with two new variants. Therefore, the MM approach is applicable to a much larger set of design situations. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|