Finding global minima with an inflection point-based filled function algorithm

This paper proposes a new definition for the term filled function, which weakens the
third condition of the filling properties. Based on this new definition, a general form
for parameter-free filled functions is created. One of the specific parameter-free filled
functions of the proposed general form is then implemented in some comparable
global optimization problems. The data generated from the numerical process reveals
that the proposed filled functions are dependable and efficient.