A new parameter free filled function for solving unconstrained global optimization problems

References

• L. Bai, J.Y. Liang, C.Y. Dang, and F.Y. Cao, A cluster centers initialization method for clustering categorical data, Expert. Syst. Appl. 39 (2012), pp. 8022–8029. doi: 10.1016/j.eswa.2012.01.131
   Web of Science ®Google Scholar
• B.C. Cetin, J. Barhen, and J.W. Burdick, Terminal repeller unconstrained subenergy tunneling (TRUST) for fast global optimization, J. Optim. Theory Appl. 77 (1993), pp. 97–126. doi: 10.1007/BF00940781
   Web of Science ®Google Scholar
• C.Y. Dang, W. Ma, and J.Y. Liang, A deterministic annealing algorithm for approximating a solution of the min-bisection problem, Neural Netw. 22 (2009), pp. 58–66. doi: 10.1016/j.neunet.2008.09.008
   PubMed Web of Science ®Google Scholar
• T.M. El-Gindy, M.S. Salim, and A.I. Ahmed, A modified partial quadratic interpolation method for unconstrained optimization, J. Concr. Appl. Math. 11 (2013), pp. 136–146.
   Google Scholar
• T.M. El-Gindy, M.S. Salim, A.I. Ahmed, A new filled function method applied to unconstrained global optimization. Appl. Math. Comput. 273 (2016), pp. 1246–1256.
   Web of Science ®Google Scholar
• C.L. Gao, Y.J. Yang, and B.S. Han, A new class of filled functions with one parameter for global optimization, Comput. Math. Appl. 62 (2011), pp. 2393–2403. doi: 10.1016/j.camwa.2011.05.006
   Web of Science ®Google Scholar
• Y. Gao, Y. Yang, and M. You, A new filled function method for global optimization, Appl. Math. Comput. 268 (2015), pp. 685–695.
   Web of Science ®Google Scholar
• R.P. Ge, A filled function method for finding a global minimizer of a function of several variables, Math. Program. 46 (1990), pp. 191–204. doi: 10.1007/BF01585737
   Web of Science ®Google Scholar
• R.P. Ge and Y.F. Qin, A class of filled functions for finding global minimizers of a function of several variables, J. Optim. Theory Appl. 54 (1987), pp. 241–252. doi: 10.1007/BF00939433
   Web of Science ®Google Scholar
• J.H. Holland, Genetic algorithms, Sci. Am. 4 (1992), pp. 14–50.
   Google Scholar
• S. Kirkpatrick, C.D Gelatt, and M.P. Vecchi, Optimization by simulate annealing, Science 220 (1983), pp. 671–680. doi: 10.1126/science.220.4598.671
   PubMed Web of Science ®Google Scholar
• Y.W. Leung and Y.P. Wang, Multiobjective programming using uniform design and genetic algorithm, IEEE Trans. Syst. Man Cybern. C 30 (2000), pp. 293–304. doi: 10.1109/5326.885111
   Web of Science ®Google Scholar
• Y.M. Liang, L.S. Zhang, M.M. Li, and B.S. Han, A filled function method for global optimization, J. Comput. Appl. Math. 205 (2007), pp. 16–31. doi: 10.1016/j.cam.2006.04.038
   Web of Science ®Google Scholar
• H. Lin, Y. Gao, and Y. Wang, A continuously differentiable filled function method for global optimization, Numer. Algorithms 66 (2014), pp. 511–523. doi: 10.1007/s11075-013-9746-3
   Web of Science ®Google Scholar
• H. Lin, Y. Wang, and L. Fan, A filled function method with one parameter for unconstrained global optimization, Appl. Math. Comput. 218 (2011), pp. 3776–3785.
   Web of Science ®Google Scholar
• H. Lin, Y. Wang, L. Fan, and Y. Gao, A new discrete filled function method for finding global minimizer of the integer programming , Appl. Math. Comput. 219 (2013), pp. 4371–4378.
   Web of Science ®Google Scholar
• X. Liu, Finding global minima with a computable filled function, J. Glob. Optim. 19 (2001), pp. 151–161. doi: 10.1023/A:1008330632677
   Web of Science ®Google Scholar
• X. Liu, A class of continuously differentiable filled functions for global optimization, IEEE Trans. Syst., Man Cyber. – Part A: Syst. Humans 38 (2008), pp. 38–47. doi: 10.1109/TSMCA.2007.909554
   Web of Science ®Google Scholar
• X. Liu and W.S. Xu, A new filled function applied to global optimization, Comput. Oper. Res. 31 (2004), pp. 61–80. doi: 10.1016/S0305-0548(02)00154-5
   Web of Science ®Google Scholar
• H. Liu, Y. Wang, S. Guan, and X. Liu, A new filled function method for unconstrained global optimization, Int. J. Comput. Math. 94 (2017), pp. 2283–2296. doi: 10.1080/00207160.2017.1283021
   Web of Science ®Google Scholar
• S. Lucidi and V. Piccialli, New classes of globally convexized filled functions for global optimization, J. Glob. Optim. 24 (2002), pp. 219–236. doi: 10.1023/A:1020243720794
   Web of Science ®Google Scholar
• S. Ma, Y. Yang, and H. Liu, A parameter free filled function for unconstrained global optimization, Appl. Math. Comput. 215 (2010), pp. 3610–3619.
   Web of Science ®Google Scholar
• R.H. Mladineo, An algorithm for finding the global maximum of a multimodal, multivariate function, Math. Program. 34 (1986), pp. 188–200. doi: 10.1007/BF01580583
   Web of Science ®Google Scholar
• K.E. Parsopoulos and M.N. Vrahatis, On the computation of all global minimizers through particle swarm optimizzation, IEEE Trans. Evolut. Comput. 8 (2004), pp. 211–224. doi: 10.1109/TEVC.2004.826076
   Web of Science ®Google Scholar
• M.S. Salim and A.I. Ahmed, A piecewise polynomial approximation for solving nonlinear optimal control problems, Far. East J. Appl. Math. 95 (2016), pp. 195–213. doi: 10.17654/AM095030195
   Google Scholar
• M.S. Salim and A.I. Ahmed, A family of quasi-Newton methods for unconstrained optimization problems, Optimization 67 (2018), pp. 1717–1727. doi: 10.1080/02331934.2018.1487423
   Web of Science ®Google Scholar
• M.S. Salim and A.I. Ahmed, A quasi-Newton augmented Lagrangian algorithm for constrained optimization problems, J. Intell. Fuzzy Syst. 35 (2018), pp. 2373–2382. doi: 10.3233/JIFS-17899
   Web of Science ®Google Scholar
• Y.-L. Shang and L.-S. Zhang, Finding discrete global minima with a filled function for integer programming, Eur. J. Oper. Res. 189 (2008), pp. 31–40. doi: 10.1016/j.ejor.2007.05.028
   Web of Science ®Google Scholar
• Y.-L. Shang, D.-G. Pu, and A.-P. Jiang, Finding global minimizer with one-parameter filled function on unconstrained global optimization, Appl. Math. Comput. 191 (2007), pp. 176–182.
   Web of Science ®Google Scholar
• Y. Shang, P. Li, and H. Xie, A new parameter-free filled function for unconstrained global optimization, 2010 Third International Joint Conference on Computational Science and Optimization, IEEE, Huangshan, 2010, pp. 65–69.
   Google Scholar
• R. Storn and K. Price, Differential evolution – A simple and efficient heuristic for global optimization over continuous spaces, J. Glob. Optim. 11 (1997), pp. 341–359. doi: 10.1023/A:1008202821328
   Web of Science ®Google Scholar
• Y.-J. Wang and J.-S. Zhang, A new constructing auxiliary function method for global optimization, Math. Comput. Model. 47 (2008), pp. 1396–1410. doi: 10.1016/j.mcm.2007.08.007
   Google Scholar
• X.L. Wang and G.B. Zhou, A new filled function for unconstrained global optimization, Appl. Math. Comput. 174 (2006), pp. 419–429.
   Web of Science ®Google Scholar
• W. Wang, Y. Shang, and L. Zhang, A filled function method with one parameter for box constrained global optimization, Appl. Math. Comput. 194 (2007), pp. 54–66.
   Web of Science ®Google Scholar
• C. Wang, Y. Yang, and J. Li, A new filled function method for unconstrained global optimization, J. Comput. Appl. Math. 225 (2009), pp. 68–79. doi: 10.1016/j.cam.2008.07.001
   Web of Science ®Google Scholar
• F. Wei, Y. Wang, and H. Lin, A new filled function method with two parameters for global optimization, J. Optim. Theory. Appl. 163 (2014), pp. 510–527. doi: 10.1007/s10957-013-0515-1
   Web of Science ®Google Scholar
• Y-T. Xu, Y. Zhang, and S.-G. Wang, A modified tunneling function method for non-smooth global optimization and its application in artificial neural network, Appl. Math. Model. 39 (2015), pp. 6438–6450. doi: 10.1016/j.apm.2015.01.059
   Web of Science ®Google Scholar
• Y. Yang and Y. Gao, A new filled function method for global optimization, 2015 IEEE International Conference on Digital Signal Processing, Singapore, (2015), pp. 54–58.
   Google Scholar
• Y.J. Yang and Y.L. Shang, A new filled function method for unconstrained global optimization, Appl. Math. Comput. 173 (2006), pp. 501–512.
   Web of Science ®Google Scholar
• Y. Yao, Dynamic tunneling algorithm for global optimization, IEEE Trans. Syst., Man Cybern. 19 (1989), pp. 1222–1230. doi: 10.1109/21.44040
   Web of Science ®Google Scholar
• L.-S. Zhang, C.-K. Ng, D. Li, and W.-W. Tian, A new filled function method for global optimization, J. Glob. Optim. 28 (2004), pp. 17–43. doi: 10.1023/B:JOGO.0000006653.60256.f6
   Web of Science ®Google Scholar
• W.X. Zhu, Unsolvability of some optimization problems, Appl. Math. Comput. 174 (2006), pp. 921–926.
   Web of Science ®Google Scholar
• W.X. Zhu, Dynamic globally concavized filled function method for continuous global optimization, J. Optim. Theory Appl. 139 (2008), pp. 635–648. doi: 10.1007/s10957-008-9405-3
   Web of Science ®Google Scholar