A New Class of Filled Functions for Global Minimization.

Filled function method is a type of efficient methods to solve global optimization problems arisen in non-convex programming. In this paper, a new class of filled functions is proposed. This class of filled functions has only one adjustable parameter a. Several examples of this class of filled functions with specified parameter values are given, which contain the filled functions proposed in [3] and [4]. These examples show this class of filled functions contains more simple functions, therefore this class of filled functions have better computability. An algorithm employing the proposed filled function is presented, and numerical experiments show that the proposed filled functions are efficient. [ABSTRACT FROM AUTHOR]