Return
Abstract
En 中文
The filled function method (FFM) is an approach to find the global minimizer of multi-modal functions. The numerical applicability of conventional filled functions is limited as they are defined on either exponential or logarithmic terms. This paper proposes a new filled function that does not have such disadvantages. An algorithm is presented according to the theoretical analysis. A computer program is designed, implemented, and tested. Numerical experiments on typical testing functions show that the new approach is superior to the conventional one. The result of optimization design for an electrical machine is also reported.
Keywords:
filled function method
global optimization
mathematical programming
minimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
No organization information available

