A computable filled function used for global minimization

作者:

Highlights:

摘要

The filled function method is an approach to find the global minimum of multimodal and multidimensional functions. This paper proposes a new filled function. This function needs only one parameter and includes neither exponential terms nor logarithmic terms. Furthermore, the lower bound of weight factor a is usually smaller than that of one previous formulation. Therefore, it is reasonable to expect that the proposed function has better computability than the previously reported ones.

论文关键词:Filled function method,Global optimization,Minimization,Nonlinear programming

论文评审过程:Available online 7 January 2002.

论文官网地址:https://doi.org/10.1016/S0096-3003(00)00157-0