zbMATH — the first resource for mathematics

A filled function which has the same local minimizer of the objective function. (English) Zbl 1428.90134
Summary: Auxiliary function methods have been considered to be practical approaches for finding the global minimizer of multi-model functions. Filled function methods, as a typical representative of auxiliary function methods, obtain a global minimizer by minimizing the objective function and the filled function cyclically. In order to improve the efficiency of the filled function, this paper presents a new filled function which has the same local minimizers of the objective function, and these minimizers are all better than the current minimizer of the objective function. Therefore, it does not need to minimize the objective function except for the first iteration in the filled function method. Additionally, the proposed filled function excludes some disadvantages of conventional filled functions and a classical local optimization method can be applied directly to the new filled function to obtain a better minimizer of the original problem. Finally, numerical experiments are made and the results show the effectiveness of the proposed method.
MSC:
 90C26 Nonconvex programming, global optimization
Full Text:
References:
 [1] Ge, R., A filled function method for finding a global minimizer of a function of several variables, Math. Program., 46, 191-204, (1990) · Zbl 0694.90083 [2] Ge, R., The theory of filled function method for finding global minimizers of nonlinearly constrained minimization problems, J. Comput. Math., 5, 1-9, (1987) · Zbl 0692.90087 [3] Levy, AV; Montalvo, A., The tunneling algorithm for the global minimization of functions, SIAM J. Sci. Stat. Comput., 6, 15-29, (1985) · Zbl 0601.65050 [4] Wang, Y.; Fang, W.; Wu, T., A cut-peak function method for global optimization, J. Comput. Appl. Math., 230, 135-142, (2009) · Zbl 1166.65030 [5] Branin, FH, Widely convergent method for finding multiple solutions of simultaneous nonlinear equations, IBM J. Res. Dev., 16, 504-522, (1972) · Zbl 0271.65034 [6] Snyman, JA; Fatti, LP, A multi-start global minimization algorithm with dynamic search trajectories, J. Optim. Theory Appl., 54, 121-141, (1987) · Zbl 0595.90073 [7] Basso, P., Iterative methods for the localization of the global maximum, SIAM J. Numer. Anal., 19, 781-792, (1982) · Zbl 0483.65038 [8] Mladineo, RH, An algorithm for finding the global maximum of a multimodal, multivariate function, Math. Program., 34, 188-200, (1986) · Zbl 0598.90075 [9] Lin, H.; Gao, Y.; Wang, Y., A continuously differentiable filled function method for global optimization, Numer. Algorithms, 66, 511-523, (2014) · Zbl 1296.65089 [10] Leung, YW; Wang, Y., Multiobjective programming using uniform design and genetic algorithm, IEEE Trans. Syst. Man Cybern. Part C, 30, 293-304, (2000) [11] Dang, C.; Ma, W.; Liang, J., A deterministic annealing algorithm for approximating a solution of the min-bisection problem, Neural Netw., 22, 58-66, (2009) · Zbl 1335.90104 [12] Li, X.; Yao, X., Cooperatively coevolving particle swarms for large scale optimization, IEEE Trans. Evolut. Comput., 16, 210-224, (2012) [13] Mininno, E.; Neri, F.; Cupertino, F.; Naso, D., Compact differential evolution, IEEE Trans. Evolut. Comput., 15, 32-54, (2011) [14] Woon, SF; Rehbock, V., A critical review of discrete filled function methods in solving nonlinear discrete optimization problems, Appl. Math. Comput., 217, 25-41, (2010) · Zbl 1200.65048 [15] Ling, AF; Xu, CX; Xu, FM, A discrete filled function algorithm for approximate global solutions of max-cut problems, J. Comput. Appl. Math., 220, 643-660, (2008) · Zbl 1148.65041 [16] Gao, Y.; Yang, Y.; You, M., A new filled function method for global optimization, Appl. Math. Comput., 268, 685-695, (2015) · Zbl 1410.90166 [17] El-Gindy, TM; Salim, MS; Ahmed, AI, A new filled function method applied to unconstrained global optimization, Appl. Math. Comput., 273, 1246-1256, (2016) · Zbl 1410.90165 [18] Liu, X., Finding global minima with a computable filled function, J. Glob. Optim., 19, 151-161, (2001) · Zbl 1033.90088 [19] Liu, X., A class of continuously differentiable filled functions for global optimization, IEEE Trans. Syst. Man Cybern. Part A Syst. Hum., 38, 38-47, (2008) [20] Zhang, LS; Ng, CK; Li, D.; Tian, WW, A new filled function method for global optimization, J. Glob. Optim., 28, 17-43, (2004) · Zbl 1061.90109
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.