A new filled function method for unconstrained global optimization
Authors:
- 6 February 2017
- journal article
- research article
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 94 (12) , 2283-2296
Abstract
Many real world problems can be modelled as optimization problems. However, the traditional algorithms for these problems often encounter the problem of being trapped in local minima. The filled function method is an effective approach to tackle this kind of problems. However the existing filled functions have the disadvantages of discontinuity, non-differentiability or sensitivity to parameters which limit their efficiency. In this paper, we proposed a new filled function which is continuous and differentiable without any parameter to tune. Compared to discontinuous or non-differentiable filled functions, the continuous and differentiable filled function mainly has three advantages: firstly, it is not easier to produce extra local minima, secondly, more efficient local search algorithms using gradient information can be applied and thirdly, a continuous and differentiable filled function can be optimized more easily. Based on the new proposed filled function, a new algorithm was designed for unconstrained global optimization problems. Numerical experiments were conducted and the results show the proposed algorithm was more efficient.Keywords
Funding Information
- National Natural Science Foundation of China (61472297, 61402350)
- the Fundamental Research Funds for the Central Universities (BDZ021430)
This publication has 32 references indexed in Scilit:
- A new filled function method applied to unconstrained global optimizationApplied Mathematics and Computation, 2016
- A new filled function method for global optimizationApplied Mathematics and Computation, 2015
- A new hybrid genetic algorithm for job shop scheduling problemComputers & Operations Research, 2012
- A new filled function algorithm for constrained global optimization problemsApplied Mathematics and Computation, 2011
- New global optimization methods for ship design problemsOptimization and Engineering, 2009
- A deterministic annealing algorithm for approximating a solution of the min-bisection problemNeural Networks, 2009
- A filled function method for global optimizationJournal of Computational and Applied Mathematics, 2006
- A parameter-free filled function for unconstrained global optimizationJournal of Shanghai University (English Edition), 2004
- A filled function method for finding a global minimizer of a function of several variablesMathematical Programming, 1990
- A class of filled functions for finding global minimizers of a function of several variablesJournal of Optimization Theory and Applications, 1987