A new parameter free filled function for solving unconstrained global optimization problems
Author:
- 1 March 2020
- journal article
- research article
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 98 (1) , 106-119
Abstract
The filled function method is an efficient approach for finding a global minimizer of global optimization problems. This paper introduces a new filled function which overcomes the drawbacks of sensitivity to parameters, containing exponential or logarithmic terms, discontinuity and non-differentiability for some previous filled functions. It proposes a filled function without any parameters to be adjusted. This filled function has no exponential or logarithmic terms which make the filled function numerically unstable. Also it is continuously differentiable, so gradient information is available in order to use effective local minimization algorithms. Theories of the proposed filled function are investigated and an algorithm for unconstrained global optimization is presented. Numerical results on many test problems with large number of variables are reported. A comparison with some existing algorithms shows that this algorithm is efficient and reliable.Keywords
This publication has 34 references indexed in Scilit:
- A new discrete filled function method for finding global minimizer of the integer programmingApplied Mathematics and Computation, 2013
- A cluster centers initialization method for clustering categorical dataExpert Systems with Applications, 2012
- A new class of filled functions with one parameter for global optimizationComputers & Mathematics with Applications, 2011
- A new filled function method for unconstrained global optimizationJournal of Computational and Applied Mathematics, 2009
- A deterministic annealing algorithm for approximating a solution of the min-bisection problemNeural Networks, 2009
- On the Computation of All Global Minimizers Through Particle Swarm OptimizationIEEE Transactions on Evolutionary Computation, 2004
- A new filled function applied to global optimizationComputers & Operations Research, 2004
- Multiobjective programming using uniform design and genetic algorithmIEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews), 2000
- Dynamic tunneling algorithm for global optimizationIEEE Transactions on Systems, Man, and Cybernetics, 1989
- Optimization by Simulated AnnealingScience, 1983