OJOp  Vol.4 No.1 , March 2015
A New Filled Function with One Parameter to Solve Global Optimization
Author(s) Hongwei Lin1, Huirong Li2
In this paper, a new filled function with only one parameter is proposed. The main advantages of the new filled function are that it not only can be analyzed easily, but also can be approximated uniformly by a continuously differentiable function. Thus, a minimizer of the proposed filled function can be obtained easily by using a local optimization algorithm. The obtained minimizer is taken as the initial point to minimize the objective function and a better minimizer will be found. By repeating the above processes, we will find a global minimizer at last. The results of numerical experiments show that the new proposed filled function method is effective.

Cite this paper
Lin, H. and Li, H. (2015) A New Filled Function with One Parameter to Solve Global Optimization. Open Journal of Optimization, 4, 10-20. doi: 10.4236/ojop.2015.41002.
[1]   Ge, R.P. (1990) A Filled Function Method for Finding a Global Minimizer of a Function of Several Variables. Mathematical Programming, 46, 191-204.

[2]   Ge, R.P. (1987) The Theory of Filled Function Method for Finding Global Minimizers of Nonlinearly Constrained Minimization Problems. Journal of Computational Mathematics, 5, 1-9.

[3]   Wang, X.L. and Zhou, G.B. (2006) A New Filled Function for Unconstrained Global Optimization. Applied Mathematics and Computation, 174, 419-429.

[4]   Wang, Y.-J. and Zhang, J.-S. (2008) A New Constructing Auxiliary Function Method for Global Optimization. Mathematical Computer Modeling, 47, 1396-1410.

[5]   Liu, X. and Xu, W. (2004) A New Filled Function Applied to Global Optimization. Computer and Operation Research, 31, 61-80.

[6]   Liu, X. (2004) The Barrier Attribute of Filled Functions. Applied Mathematics and Computation, 149, 641-649.

[7]   Dixon, L.C.W., Gomulka, J. and Herson, S.E. (1976) Reflections on Global Optimization Problem, Optimization in Action. Academic Press, New York, 398-435.

[8]   Liang, Y.M., Zhang, L.S., Li, M.M. and Han, B.S. (2007) A Filled Function Method for Global Optimization. Journal of Computational and Applied Mathematics, 205, 16-31.

[9]   Ling, A.-F., Xu, C.-X. and Xua, F.-M. (2008) A Discrete Filled Function Algorithm for Approximate Global Solutions of Max-Cut Problems. Journal of Computational and Applied Mathematics, 220, 643-660.

[10]   Polak, E., Royset, J.O. and Womersley, R.S. (2003) Algorithms with Adaptive Smoothing for Finite Minimax Problems. Journal of Optimization Theory and Applications, 119, 459-484.

[11]   Zhang, L.-S., Ng, C.-K., Li, D. and Tian, W.-W. (2004) A New Filled Function Method for Global Optimization. Journal of Global Optimization, 28, 17-43.