Dynamic globally concavized filled function method for continuous global optimization
In the work one of the global optimization basic procedures is developed: the filled function method. After the good introduction, the author gives a new filled function definition, namely that of a globally concavized filled function. The appropriate algorithm for the box-constrained continuous global minimization problem is proposed; the convergence is analyzed. The author: ``Numerical experiments on a set of standard testing functions show that the resulting method is competitive with some well-known global minimization methods''.
scientific article; zbMATH DE number 5547296