A Derivative-Free Filter Driven Multistart Technique for Global Optimization
Conference paper
- 3 Citations
- 1.8k Downloads
Abstract
A stochastic global optimization method based on a multistart strategy and a derivative-free filter local search for general constrained optimization is presented and analyzed. In the local search procedure, approximate descent directions for the constraint violation or the objective function are used to progress towards the optimal solution. The algorithm is able to locate all the local minima, and consequently, the global minimum of a multi-modal objective function. The performance of the multistart method is analyzed with a set of benchmark problems and a comparison is made with other methods.
Keywords
Global optimization Multistart Descent Direction Filter MethodPreview
Unable to display preview. Download preview PDF.
References
- 1.Ali, M.M., Gabere, M.N.: A simulated annealing driven multi-start algorithm for bound constrained global optimization. Journal of Computational and Applied Mathematics 233, 2661–2674 (2010)MathSciNetzbMATHCrossRefGoogle Scholar
- 2.Audet, C., Dennis Jr., J.E.: A pattern search filter method for nonlinear programming without derivatives. SIAM Journal on Optimization 14(4), 980–1010 (2004)MathSciNetzbMATHCrossRefGoogle Scholar
- 3.Costa, M.F.P., Fernandes, E.M.G.P.: Assessing the potential of interior point barrier filter line search methods: nonmonotone versus monotone approach. Optimization 60(10-11), 1251–1268 (2011)MathSciNetzbMATHCrossRefGoogle Scholar
- 4.Fletcher, R., Leyffer, S.: Nonlinear programming without a penalty function. Mathematical Programming 91, 239–269 (2002)MathSciNetzbMATHCrossRefGoogle Scholar
- 5.Hedar, A.R., Fukushima, M.: Derivative-Free Filter Simulated Annealing Method for Constrained Continuous Global Optimization. Journal of Global Optimization 35, 521–549 (2006)MathSciNetzbMATHCrossRefGoogle Scholar
- 6.Lagaris, I.E., Tsoulos, I.G.: Stopping rules for box-constrained stochastic global optimization. Applied Mathematics and Computation 197, 622–632 (2008)MathSciNetzbMATHCrossRefGoogle Scholar
- 7.Marti, R.: Multi-start methods. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 355–368. Kluwer, Dordrecht (2003)Google Scholar
- 8.Rocha, A.M.A.C., Fernandes, E.M.G.P.: Mutation-Based Artificial Fish Swarm Algorithm for Bound Constrained Global Optimization. In: Numerical Analysis and Applied Mathematics ICNAAM 2011. AIP Conf. Proc., vol. 1389, pp. 751–754 (2011)Google Scholar
- 9.Tsoulos, I.G., Lagaris, I.E.: MinFinder: Locating all the local minima of a function. Computer Physics Communications 174, 166–179 (2006)MathSciNetzbMATHCrossRefGoogle Scholar
- 10.Tu, W., Mayne, R.W.: Studies of multi-start clustering for global optimization. International Journal for Numerical Methods in Engineering 53(9), 2239–2252 (2002)MathSciNetzbMATHCrossRefGoogle Scholar
- 11.Voglis, C., Lagaris, I.E.: Towards ”Ideal Multistart”. A stochastic approach for locating the minima of a continuous function inside a bounded domain. Applied Mathematics and Computation 213, 1404–1415 (2009)MathSciNetCrossRefGoogle Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 2012