References
- L. An, L.-S. Zhang, and M.-L. Chen, A parameter-free filled function for unconstrained global optimization, J. Shanghai Univ. 8 (2004), pp. 117–123.
- E.F. Campana, G. Liuzzi, S. Lucidi, D. Peri, V. Piccialli, and A. Pinto, New global optimization methods for ship design problems, Optim. Eng. 10 (2009), pp. 533–555. Available at http://dx.doi.org/10.1007/s11081-009-9085-3.
- C. Dang, W. Ma, and J. Liang, A deterministic annealing algorithm for approximating a solution of the min-bisection problem, Neural Netw. 22 (2009), pp. 58–66. Available at http://www.sciencedirect.com/science/article/pii/S0893608008001913.
- R.Q. dao-er-ji and Y. Wang, A new hybrid genetic algorithm for job shop scheduling problem, Comput. Oper. Res. 39 (2012), pp. 2291–2299. Available at http://www.sciencedirect.com/science/article/pii/S0305054811003601.
- T.M. El-Gindy, M.S. Salim, and A.L. Ahmed, A new filled function method applied to unconstrained global optimization, Appl. Math. Comput. 273 (2016), pp. 1246–1256. Available at http://www.sciencedirect.com/science/article/pii/S0096300315011479.
- Y. Gao, Y. Yang, and M. You, A new filled function method for global optimization, Appl. Math. Comput. 268 (2015), pp. 685–695. Available at http://www.sciencedirect.com/science/article/pii/S0096300315008711.
- R. Ge, The theory of filled function method for finding global minimizers of nonlinearly constrained minimization problems, J. Comput. Math. 5 (1987), pp. 1–9.
- R. Ge, A filled function method for finding a global minimizer of a function of several variables, Math. Program. 46 (1990), pp. 191–204. Available at http://dx.doi.org/10.1007/BF01585737.
- 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. Available at http://dx.doi.org/10.1007/BF00939433.
- S. He, W. Chen, and H. Wang, A new filled function algorithm for constrained global optimization problems, Appl. Math. Comput. 217 (2011), pp. 5853–5859. Available at http://www.sciencedirect.com/science/article/pii/S0096300310012725.
- 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. Available at http://www.sciencedirect.com/science/article/pii/S0377042706002536.
- H. Lin, Y. Gao, and Y. Wang, A continuously differentiable filled function method for global optimization, Numer. Algorithms 66 (2014), pp. 511–523. Available at http://dx.doi.org/10.1007/s11075-013-9746-3.
- 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. Available at http://www.sciencedirect.com/science/article/pii/S009630031101188X.
- B.W.K. Ling, C.Z. Wu, K.L. Teo, and V. Rehbock, Global optimal design of iir filters via constraint transcription and filled function methods, Circuits Systems Signal Process. 32 (2013), pp. 1313–1334. Available at http://dx.doi.org/10.1007/s00034-012-9511-1.
- Y. Lin Shang and L. Sheng Zhang, Finding discrete global minima with a filled function for integer programming, European J. Oper. Res. 189 (2008), pp. 31–40. Available at http://www.sciencedirect.com/science/article/pii/S0377221707005048.
- Y. Lin Shang, D. Guo Pu, and A. Ping Jiang, Finding global minimizer with one-parameter filled function on unconstrained global optimization, Appl. Math. Comput. 191 (2007), pp. 176–182. Available at http://www.sciencedirect.com/science/article/pii/S009630030700241X.
- X. Liu, Finding global minima with a computable filled function, J. Global Optim. 19 (2001), pp. 151–161. Available at http://dx.doi.org/10.1023/A%3A1008330632677.
- X. Liu, A class of continuously differentiable filled functions for global optimization, IEEE Trans. Syst. Man Cybern. A, Syst. Humans 38 (2008), pp. 38–47.
- X. Liu and W. Xu, A new filled function applied to global optimization, Comput. Oper. Res. 31 (2004), pp. 61–80. Available at http://www.sciencedirect.com/science/article/pii/S0305054802001545.
- S. Lucidi and V. Piccialli, New classes of globally convexized filled functions for global optimization, J. Global Optim. 24 (2002), pp. 219–236. Available at http://dx.doi.org/10.1023/A%3A1020243720794.
- S. Ma, Y. Yang, and H. Liu, A parameter free filled function for unconstrained global optimization, Appl. Math. Comput. 215 (2010), pp. 3610–3619. Available at http://www.sciencedirect.com/science/article/pii/S0096300309009734.
- S. Mahdavi, M.E. Shiri, and S. Rahnamayan, Metaheuristics in large-scale global continues optimization: A survey, Inform. Sci. 295 (2015), pp. 407–428. Available at http://www.sciencedirect.com/science/article/pii/S0020025514010251.
- J.M. Ortega and W.C. Rheinboldt, Iterative solution of nonlinear equations in several variables, Academic Press 3 (1970), pp. 108–109. Available at http://www.sciencedirect.com/science/article/pii/S0307904X08002734.
- A. Sahiner, N. Yilmaz, and O. Demirozer, Mathematical modeling and an application of the filled function method in entomology, Int. J. Pest Manag. 60 (2014), pp. 232–237. Available at http://dx.doi.org/10.1080/09670874.2014.958879.
- Z. Wan, L. Yuan, and J. Chen, A filled function method for nonlinear systems of equalities and inequalities, Comput. Appl. Math. 31 (2012), pp. 391–405.
- 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. Available at http://www.sciencedirect.com/science/article/pii/S0096300307004432.
- 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. Available at http://www.sciencedirect.com/science/article/pii/S0377042708003208.
- F. Wei and Y. Wang, A new filled function method with one parameter for global optimization, Math. Probl. Eng. 2013 (2013), pp. 1–12.
- 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. Available at http://dx.doi.org/10.1007/s10957-013-0515-1.
- W. Weixiang, S. Youlin, and Z. Liansheng, A filled function method for unconstrained global optimization, Oper. Res. Trans. 11 (2007), pp. 43–50.
- X. Wu, K. Zhang, and C. Sun, Constrained optimal control of switched systems based on modified bfgs algorithm and filled function method, Int. J. Comput. Math. 91 (2014), pp. 1713–1729. Available at http://dx.doi.org/10.1080/00207160.2013.859678.
- Y. Yang and Y. Gao, A new filled function method for global optimization, IEEE International Conference on Digital Signal Processing, 2015, pp. 54–58.
- Y. Zhang and Y.-T. Xu, A one-parameter filled function method applied to nonsmooth constrained global optimization, Comput. Math. Appl. 58 (2009), pp. 1230–1238. Available at http://www.sciencedirect.com/science/article/pii/S0898122109004763.
- L.-S. Zhang, C.-K. Ng, D. Li, and W.-W. Tian, A new filled function method for global optimization, J. Global Optim. 28 (2004), pp. 17–43. Available at http://dx.doi.org/10.1023/B%3AJOGO.0000006653.60256.f6.
- Y. Zhang, L. Zhang, and Y. Xu, New filled functions for nonsmooth global optimization, Appl. Math. Model. 33 (2009), pp. 3114–3129. Available at http://www.sciencedirect.com/science/article/pii/S0307904X08002734.
- W.X. Zhu, Dynamic globally concavized filled function method for continuous global optimization, J. Optim. Theory Appl. 139 (2008), pp. 635–648. Available at http://dx.doi.org/10.1007/s10957-008-9405-3.