A filled function method for global optimization with inequality constraints

In this paper, we propose a new filled function method for finding a global minimizer of global optimization with inequality constraints. The proposed filled function is a continuously differentiable function with only one parameter. Then, we can use classical local optimization methods to find a better minimizer of the proposed filled function with a few parameter adjustment. The numerical experiments are made and the results show that the proposed filled function method is effective.

[1]  Panos M. Pardalos,et al.  A Collection of Test Problems for Constrained Global Optimization Algorithms , 1990, Lecture Notes in Computer Science.

[2]  Ying Zhang,et al.  A filled function method applied to nonsmooth constrained global optimization , 2009, J. Comput. Appl. Math..

[3]  P. Basso.  Iterative Methods for the Localization of the Global Maximum , 1982 .

[4]  J. Snyman,et al.  A multi-start global minimization algorithm with dynamic search trajectories , 1987 .

[5]  Hui Wang,et al.  A new filled function algorithm for constrained global optimization problems , 2011, Appl. Math. Comput..

[6]  Yuping Wang,et al.  An orthogonal genetic algorithm with quantization for global numerical optimization , 2001, IEEE Trans. Evol. Comput..

[7]  F. H. Branin.  Widely convergent method for finding multiple solutions of simultaneous nonlinear equations , 1972 .

[8]  Chuangyin Dang,et al.  A deterministic annealing algorithm for approximating a solution of the max-bisection problem , 2002, Neural Networks.

[9]  Regina Hunter Mladineo.  An algorithm for finding the global maximum of a multimodal, multivariate function , 1986, Math. Program..

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

[11]  C. Floudas.  Handbook of Test Problems in Local and Global Optimization , 1999 .

[12]  Duan Li,et al.  A New Filled Function Method for Global Optimization , 2004, J. Glob. Optim..

[13]  Mordecai Avriel,et al.  Nonlinear programming , 1976 .

[14]  Stefano Lucidi,et al.  New Classes of Globally Convexized Filled Functions for Global Optimization , 2002, J. Glob. Optim..

[15]  Yuping Wang,et al.  A continuously differentiable filled function method for global optimization , 2013, Numerical Algorithms.

[16]  Xian Liu.  The barrier attribute of filled functions , 2004, Appl. Math. Comput..

[17]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[18]  Xian Liu,et al.  A Class of Continuously Differentiable Filled Functions for Global Optimization , 2008, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[19]  Changhe Li,et al.  A General Framework of Multipopulation Methods With Clustering in Undetectable Dynamic Environments , 2012, IEEE Transactions on Evolutionary Computation.

[20]  Xian Liu.  Finding Global Minima with a Computable Filled Function , 2001, J. Glob. Optim..

[21]  Wang Wei-xiang.  A Filled Function Method with One Parameter for Constrained Global Optimization , 2008 .

[22]  Xiaodong Li,et al.  Cooperatively Coevolving Particle Swarms for Large Scale Optimization , 2012, IEEE Transactions on Evolutionary Computation.

[23]  A. V. Levy,et al.  The Tunneling Algorithm for the Global Minimization of Functions , 1985 .

[24]  Zhi-You Wu,et al.  A filled function method for constrained global optimization , 2007, J. Glob. Optim..

[25]  Yuping Wang,et al.  Multiobjective programming using uniform design and genetic algorithm , 2000, IEEE Trans. Syst. Man Cybern. Part C.