Abstract
The Nelder-Mead Algorithm (NMA) is an almost half-century old method for numerical optimization, and it is a close relative of Particle Swarm Optimization (PSO) and Differential Evolution (DE). Geometric Particle Swarm Optimization (GPSO) and Geometric Differential Evolution (GDE) are recently introduced formal generalization of traditional PSO and DE that apply naturally to both continuous and combinatorial spaces. In this paper, we generalize NMA to combinatorial search spaces by naturally extending its geometric interpretation to these spaces, analogously as what was done for the traditional PSO and DE algorithms, obtaining the Geometric Nelder-Mead Algorithm (GNMA).
This is a preview of subscription content, log in via an institution to check access.
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
Kauffman, S.: Origins of order: self-organization and selection in evolution. Oxford University Press, Oxford (1993)
Kennedy, J., Eberhart, R.C.: Swarm Intelligence. Morgan Kaufmann, San Francisco (2001)
Luo, C., Yu, B.: Low dimensional simplex evolution: a hybrid heuristic for global optimization. In: Eighth International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, vol. 2, pp. 470–474 (2007)
Moraglio, A.: Towards a geometric unification of evolutionary algorithms. PhD thesis, University of Essex (2007)
Moraglio, A., Chio, C.D., Poli, R.: Geometric particle swarm optimization. In: Ebner, M., O’Neill, M., Ekárt, A., Vanneschi, L., Esparcia-Alcázar, A.I. (eds.) EuroGP 2007. LNCS, vol. 4445, pp. 125–136. Springer, Heidelberg (2007)
Moraglio, A., Chio, C.D., Togelius, J., Poli, R.: Geometric particle swarm optimization. Journal of Artificial Evolution and Applications (2008) Article ID 143624
Moraglio, A., Togelius, J.: Geometric pso for the sudoku puzzle. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 118–125 (2007)
Moraglio, A., Togelius, J.: Geometric differential evolution. In: Proceedings of the 11th Annual conference on Genetic and evolutionary computation, pp. 1705–1712 (2009)
Nelder, J.A., Mead, R.A.: A simplex method for function minimization. Computer Journal 7, 308–313 (1965)
Pelikan, M.: NK landscape generator and instances provided online
Pelikan, M.: Analysis of estimation of distribution algorithms and genetic algorithms on nk-landscapes. In: Proceedings of the 2008 Genetic and Evolutionary Computation Conference (GECCO 2008), pp. 1033–1040. ACM Press, New York (2008)
Price, K.V., Storm, R.M., Lampinen, J.A.: Differential Evolution: A Practical Approach to Global Optimization. Springer, Heidelberg (2005)
Takahama, T., Sakai, S.: Constrained optimization by applying the α-constrained method to the nonlinear simplex method with mutations. IEEE Transactions on Evolutionary Computation 9(5), 437–451 (2005)
Togelius, J., Nardi, R.D., Moraglio, A.: Geometric pso + gp = particle swarm programming. In: Proceedings of the Congress on Evolutionary Comptutation, CEC (2008)
Wang, F., Qiu, Y.: Empirical study of hybrid particle swarm optimizers with the simplex method operator. In: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications, pp. 308–313 (2005)
Weise, T.: Global Optimization Algorithms - Theory and Application. on-line ebook (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moraglio, A., Johnson, C.G. (2010). Geometric Generalization of the Nelder-Mead Algorithm. In: Cowling, P., Merz, P. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2010. Lecture Notes in Computer Science, vol 6022. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12139-5_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-12139-5_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12138-8
Online ISBN: 978-3-642-12139-5
eBook Packages: Computer ScienceComputer Science (R0)