×

A new filled function method with two parameters for global optimization. (English) Zbl 1305.65155

Summary: The filled function method is an effective approach to find the global minimizer of multi-modal functions. The conventional filled functions are often numerically unstable due to the exponential or logarithmic term and the sensitivity to parameters. In this paper, a new filled function is proposed, which is continuously differentiable, not sensitive to parameters, and not easy to cause overflow. Then a new local search algorithm is given. Based on this, a new filled function method is proposed. The simulations indicate that the proposed method is numerically stable to the variations of the initial points and the parameters. The comparison with some existing algorithms shows that the proposed method is more efficient and effective.

MSC:

65K05 Numerical mathematical programming methods
90C26 Nonconvex programming, global optimization
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Ge, R.P.: A filled function method for finding a global minimizer of a function of several variables. Math. Program. 46, 191-204 (1990) · Zbl 0694.90083 · doi:10.1007/BF01585737
[2] Ge, R.P., Qin, Y.F.: A class of filled functions for finding global minimizers of a function of several variables. J. Optim. Theory Appl. 54, 241-252 (1987) · Zbl 0595.65072 · doi:10.1007/BF00939433
[3] Ma, S.Z., Yang, Y.J., Liu, H.Q.: A parameter free filled function for unconstrained global optimization. Appl. Math. Comput. 215, 3610-3619 (2010) · Zbl 1192.65081 · doi:10.1016/j.amc.2009.10.057
[4] Branin, F.: Widely convergent methods for finding multiple solutions of simultaneous nonlinear equations. IBM J. Res. Dev. 16, 504-522 (1972) · Zbl 0271.65034 · doi:10.1147/rd.165.0504
[5] Levy, A.V., Montalvo, A.: The tunneling algorithm for the global minimization of functions. SIAM J. Sci. Stat. Comput. 6, 15-29 (1985) · Zbl 0601.65050 · doi:10.1137/0906002
[6] Basso, P.: Iterative methods for the localization of the global maximum. SIAM J. Numer. Anal. 19, 781-792 (1982) · Zbl 0483.65038 · doi:10.1137/0719054
[7] Bai, L., Liang, J.Y., Dang, C.Y., Cao, F.Y.: A cluster centers initialization method for clustering categorical data. Expert Syst. Appl. 39, 8022-8029 (2012) · doi:10.1016/j.eswa.2012.01.131
[8] Wang, Y.P.: A uniform enhancement approach for optimization algorithms: smoothing function method. Int. J. Pattern Recognit. 24, 1111-1131 (2010) · doi:10.1142/S0218001410008287
[9] Leung, Y.W., Wang, Y.P.: An orthogonal genetic algorithm with quantization for global numerical optimization. IEEE T. Evolut. Comput. 5, 41-53 (2001) · doi:10.1109/4235.910464
[10] Dang, C.Y., Ma, W., Liang, J.Y.: A deterministic annealing algorithm for approximating a solution of the min-bisection problem. Neural Netw. 22, 58-66 (2009) · Zbl 1335.90104 · doi:10.1016/j.neunet.2008.09.008
[11] Leung, Y.W., Wang, Y.P.: Multiobjective programming using uniform design and genetic algorithm. IEEE Trans. Syst. Man Cybren. C 30, 293-304 (2000) · doi:10.1109/5326.885111
[12] Liu, X.: Finding global minima with a computable filled function. J. Glob. Optim. 19, 151-161 (2001) · Zbl 1033.90088 · doi:10.1023/A:1008330632677
[13] Zhang, Y., Zhang, L.S., Xu, Y.T.: New filled functions for nonsmooth global optimization. Appl. Math. Model. 33, 3114-3129 (2009) · Zbl 1205.90236 · doi:10.1016/j.apm.2008.10.015
[14] Gao, C.L., Yang, Y.J., Han, B.S.: A new class of filled functions with one parameter for global optimization. Comput. Math. Appl. 62, 2393-2403 (2011) · Zbl 1231.65109 · doi:10.1016/j.camwa.2011.05.006
[15] Lucidi, S., Piccialli, V.: New classes of globally convexized filled functions for global optimization. J. Glob. Optim. 24, 219-236 (2002) · Zbl 1047.90051 · doi:10.1023/A:1020243720794
[16] Avriel, M.: Nonlinear Programming: Analysis and Methods. Prentice-Hall, Englewood Cliffs (1976) · Zbl 0361.90035
[17] Fang, K.T., Wang, Y.: Number-Theoretic Methods in Statistics. Chapman & Hall, London (1994) · Zbl 0925.65263 · doi:10.1007/978-1-4899-3095-8
[18] Broyden, C.G.: The convergence of a class of double-rank minimization algorithms. IMA J. Appl. Inst. Math. 6, 76-90 (1970) · Zbl 0223.65023 · doi:10.1093/imamat/6.1.76
[19] Fletcher, R.: A new approach to variable metric algorithms. Comput. J. 13, 317-322 (1970) · Zbl 0207.17402 · doi:10.1093/comjnl/13.3.317
[20] Goldfarb, D.: A family of variable metric updates derived by variational means. Math. Comput. 24, 23-26 (1970) · Zbl 0196.18002 · doi:10.1090/S0025-5718-1970-0258249-6
[21] Shanno, D.F.: Conditioning of quasi-Newton methods for function minimization. Math. Comput. 24, 647-656 (1970) · Zbl 0225.65073 · doi:10.1090/S0025-5718-1970-0274029-X
[22] Hedar, A.: Test functions for unconstrained global optimization. http://www-optima.amp.i.kyoto-u.ac.jp/member/student/hedar/Hedar_files/TestGO_files/Page364.htm. Accessed 15 Feb 2013 · Zbl 0601.65050
[23] Hedar, A., Fukushima, M.: Tabu search directed by direct search methods for nonlinear global optimization. Eur. J. Oper. Res. 170, 329-349 (2006) · Zbl 1093.90091 · doi:10.1016/j.ejor.2004.05.033
[24] Chelouah, R., Siarry, P.: Tabu search applied to global optimization. Eur. J. Oper. Res. 123, 256-270 (2000) · Zbl 0961.90037 · doi:10.1016/S0377-2217(99)00255-6
[25] Franze, F., Speciale, N.: A tabu-search-based algorithm for continuous multiminima problems. Int. J. Numer. Eng. 50, 665-680 (2001) · Zbl 1010.74047 · doi:10.1002/1097-0207(20010130)50:3<665::AID-NME43>3.0.CO;2-U
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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.