A class of generalized filled functions with improved computability

摘要

The filled function method (FFM) is an approach to find the global minimum of multimodal functions. The computability 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. Numerical experiments on typical testing functions showed that the new function is superior to the conventional one.