Multilocal Programming: A Derivative-Free Filter Multistart Algorithm
Conference paper
- 5 Citations
- 1.8k Downloads
Abstract
Multilocal programming aims to locate all the local solutions of an optimization problem. A stochastic method based on a multistart strategy and a derivative-free filter local search for solving general constrained optimization problems is presented. The filter methodology is integrated into a coordinate search paradigm in order to generate a set of trial approximations that might be acceptable if they improve the constraint violation or the objective function value relative to the current one. Preliminary numerical experiments with a benchmark set of problems show the effectiveness of the proposed method.
Keywords
Multilocal programming multistart derivative-free coordinate search 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. J. Comput. Appl. Math. 233, 2661–2674 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
- 2.Ali, M.M., Khompatraporn, C., Zabinsky, Z.B.: A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems. J. Glob. Optim. 31, 635–672 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
- 3.Audet, C., Dennis Jr., J.E.: A pattern search filter method for nonlinear programming without derivatives. SIAM J. Optimiz. 14(4), 980–1010 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
- 4.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)MathSciNetCrossRefzbMATHGoogle Scholar
- 5.Fernandes, F.P., Costa, M.F.P., Fernandes, E.M.G.P.: Stopping rules effect on a derivative-free filter multistart algorithm for multilocal programmnig. In: ICACM 2012, 6 p. (2012), file:131-1395-1-PB.pdf, http://icacm.iam.metu.edu.tr/all-talks
- 6.Fernandes, F.P., Costa, M.F.P., Fernandes, E.M.G.P.: A derivative-free filter driven multistart technique for global optimization. In: Murgante, B., Gervasi, O., Misra, S., Nedjah, N., Rocha, A.M.A.C., Taniar, D., Apduhan, B.O. (eds.) ICCSA 2012, Part III. LNCS, vol. 7335, pp. 103–118. Springer, Heidelberg (2012)CrossRefGoogle Scholar
- 7.Fletcher, R., Leyffer, S.: Nonlinear programming without a penalty function. Math. Program. 91, 239–269 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
- 8.Floudas, C.A., Pardalos, P.M., Adjiman, C.S., Esposito, W.R., Gumus, Z.H., Harding, S.T., Klepeis, J.L., Meyer, C.A., Schweiger, C.A.: Handbook of Test Problems in Local and Global Optimization. Kluwer Academic Publishers (1999)Google Scholar
- 9.Hedar, A.R., Fukushima, M.: Derivative-Free Filter Simulated Annealing Method for Constrained Continuous Global Optimization. J. Glob. Optim. 35, 521–549 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
- 10.Hendrix, E.M.T., G.-Tóth, B.: Introduction to Nonlinear and Global Optimization. Springer Optimization and Its Applications, vol. 37 (2010)Google Scholar
- 11.Kolda, T.G., Lewis, R.M., Torczon, V.: Optimization by Direct Search: New Perspectives on Some Classical and Moddern Methods. SIAM Rev. 45(3), 385–482 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
- 12.Koziel, S., Michalewicz, Z.: Evolutionary algorithms, homomorphous mappings, and constrained parameter optimization. Evol. Comput. 7(1), 19–44 (1999)CrossRefGoogle Scholar
- 13.Krishnanand, K.N., Ghose, D.: Glowworm swarm optimization for simultaneous capture of multiple local optima of multimodal functions. Swarm Intell. 3, 87–124 (2009)CrossRefGoogle Scholar
- 14.Lagaris, I.E., Tsoulos, I.G.: Stopping rules for box-constrained stochastic global optimization. Appl. Math. Comput. 197, 622–632 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
- 15.Marti, R.: Multi-start methods. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 355–368. Kluwer Academic Publishers (2003)Google Scholar
- 16.Ozdamar, L., Demirhan, M.: Experiments with new stochastic global optimization search techniques. Comput. Oper. Res. 27, 841–865 (2000)CrossRefGoogle Scholar
- 17.Parsopoulos, K.E., Vrahatis, M.N.: On the computation of all global minimizers through particle swarm optimization. IEEE T. Evolut. Comput. 8(3), 211–224 (2004)MathSciNetCrossRefGoogle Scholar
- 18.Pereira, A., Ferreira, O., Pinho, S.P., Fernandes, E.M.G.P.: Multilocal Programming and Applications. In: Zelinka, I., et al. (eds.) Handbook of Optimization. Intelligent Systems Series, pp. 157–186. Springer (2013)Google Scholar
- 19.Ryoo, H.S., Sahinidis, N.V.: Global optimization of nonconvex NLPs and MINLPs with applications in process design. Comput. Chem. Eng. 19(5), 551–566 (1995)CrossRefGoogle Scholar
- 20.Singh, G., Deb, K.: Comparison of multi-modal optimization algorithms based on evolutionary algorithms. In: GECCO 2006, pp. 1305–1312. ACM Press (2006)Google Scholar
- 21.Tsoulos, I.G., Lagaris, I.E.: MinFinder: Locating all the local minima of a function. Computer Phys. Com. 174, 166–179 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
- 22.Tsoulos, I.G., Stavrakoudis, A.: On locating all roots of systems of nonlinear equations inside bounded domain using global optimization methods. Nonlinear Anal. Real 11, 2465–2471 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
- 23.Tu, W., Mayne, R.W.: Studies of multi-start clustering for global optimization. Int. J. Numer. Meth. Eng. 53(9), 2239–2252 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
- 24.Voglis, C., Lagaris, I.E.: Towards “Ideal Multistart”. A stochastic approach for locating the minima of a continuous function inside a bounded domain. Appl. Math. Comput. 213, 1404–1415 (2009)MathSciNetCrossRefGoogle Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 2013