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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
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)
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)
Fletcher, R., Leyffer, S.: Nonlinear programming without a penalty function. Mathematical Programming 91, 239–269 (2002)
Hedar, A.R., Fukushima, M.: Derivative-Free Filter Simulated Annealing Method for Constrained Continuous Global Optimization. Journal of Global Optimization 35, 521–549 (2006)
Lagaris, I.E., Tsoulos, I.G.: Stopping rules for box-constrained stochastic global optimization. Applied Mathematics and Computation 197, 622–632 (2008)
Marti, R.: Multi-start methods. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 355–368. Kluwer, Dordrecht (2003)
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)
Tsoulos, I.G., Lagaris, I.E.: MinFinder: Locating all the local minima of a function. Computer Physics Communications 174, 166–179 (2006)
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)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fernandes, F.P., Costa, M.F.P., Fernandes, E.M.G.P. (2012). A Derivative-Free Filter Driven Multistart Technique for Global Optimization. In: Murgante, B., et al. Computational Science and Its Applications – ICCSA 2012. ICCSA 2012. Lecture Notes in Computer Science, vol 7335. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31137-6_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-31137-6_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31136-9
Online ISBN: 978-3-642-31137-6
eBook Packages: Computer ScienceComputer Science (R0)