论文信息 - A new algorithm for constrained global optimization based on filled function

A new algorithm for constrained global optimization based on filled function

In this paper, we propose a filled function method for constrained global optimization. This filled function contains only one parameter which is easily to be chosen. Then we investigate the properties of this function and design a new algorithm based on this function. Last, we make a numerical test. The numerical results show the efficiency of this global optimization method.

[1] Liansheng Zhang,et al. A filled function method for global optimization , 2007 .

[2] Xiaoli Wang,et al. A new filled function for unconstrained global optimization , 2006, Appl. Math. Comput..

[3] Panos M. Pardalos,et al. Introduction to Global Optimization , 2000, Introduction to Global Optimization.

[4] Panos M. Pardalos,et al. Filled functions for unconstrained global optimization , 2001, J. Glob. Optim..

[5] R. Ge,et al. A class of filled functions for finding global minimizers of a function of several variables , 1987 .

[6] P. Pardalos,et al. Recent developments and trends in global optimization , 2000 .

[7] Renpu Ge,et al. A Filled Function Method for Finding a Global Minimizer of a Function of Several Variables , 1990, Math. Program..

[8] Karla L. Hoffman,et al. A method for globally minimizing concave functions over convex sets , 1981, Math. Program..