Abstract
One of the most serious problem concerning global optimization methods is their correct configuration. Usually algorithms are described by some number of external parameters for which optimal values strongly depend on the objective function. If there is a lack of knowledge on the function under consideration the optimization algorithms can by adjusted using trail-and-error method. Naturally, this kind of approach gives rise to many computational problems. Moreover, it can be applied only when a lot of function evaluations is allowed. In order to avoid trial-and-error method it is reasonable to use an optimization algorithm which is characterized by the highest degree of robustness according to the variations in its control parameters. In this paper, the robustness issue of evolutionary strategy with isotropic stable mutations is discussed. The experimental simulations are conducted with the help of special search environment - the so-called general search space.
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
Beyer, H.G., Schwefel, H.P.: Evolution strategies - a comprehensive introduction. Natural Computing 1(1), 3–52 (2002)
Bonnans, J.F., Gilbert, J.C., Lemaréchal, C., Sagastizábal, C.: Numerical Optimization. Springer, Heidelberg (2003)
Cullen, H.F.: The stone-weierstrass theorem and complex stone-weierstrass theorem. In: Introduction to General Topology, pp. 286–293. Heath, Boston, MA (1968)
Fang, K.T., Kotz, S., KaiWang, N.: Symmetric Multivariate and Related Distributions. Chapman and Hall, London (1990)
Feller, W.: An Introduction to Probability Theory and Its Application. John Wiley and Sons, Inc., Chichester (1957)
Ho, Y.C., Pepyne, D.L.: Simple explanation of the no-free-lunch theorem and its implications. Journal of Optimization Theory and Applications (115) (2002)
Jones, D.R., Schonlau, M., Welch, W.J.: Efficient global optimization of expensive black-box functions. J. of Global Optimization 13(4), 455–492 (1998)
Karcz-Dul¸eba, I.: Asymptotic behaviour of a discrete dynamical system generated by a simple evolutionary process. International Journal of Applied Mathematics and Computer Science 14(1), 79–90 (2004)
Nolan, J.P.: Stable Distributions - Models for Heavy Tailed Data, ch. 1, Birkhäuser, Boston (in progress, 2007), academic2.american.edu/~jpnolan
Obuchowicz, A., Prȩtki, P.: Phenotypic evolution with a mutation based on symmetric α-stable distributions. International Journal of Applied Mathematics and Computer Science 14(3), 289–316 (2004)
Rudolph, G.: Convergence of evolutionary algorithms in general search spaces. In: Proc. ICEC 1996, Nagoya, pp. 50–54 (1996)
Rudolph, G.: Local convergence rates of simple evolutionary algorithms with cauchy mutations. IEEE Transactions on Evolutionary Computation 1(4), 249–258 (1997)
Samorodnitsky, G., Taqqu, M.S.: Stable Non-Gaussian Random Processes. Chapman and Hall, New York (1994)
Törn, A., Zilinskas, A.: Global optimization. Springer, New York (1989)
Vidyasagar, M.: Randomized algorithms for robust controller synthesis using statistical learning theory. Automatica 37(10), 1515–1528 (2001)
Wang, G., Goodman, E.D., Punch, W.F.: Toward the optimization of a class of black box optimization algorithms. In: ICTAI 1997: Proceedings of the 9th International Conference on Tools with Artificial Intelligence, p. 348. IEEE Computer Society, Washington, DC, USA (1997)
Wolpert, D., Macready, W.: The mathematics of search (1994)
Zolotariev, A.: One-Dimensional Stable Distributions. American Mathematical Society, Providence (1986)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Prętki, P., Obuchowicz, A. (2008). Robustness of Isotropic Stable Mutations in a General Search Space. In: Rutkowski, L., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds) Artificial Intelligence and Soft Computing – ICAISC 2008. ICAISC 2008. Lecture Notes in Computer Science(), vol 5097. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69731-2_45
Download citation
DOI: https://doi.org/10.1007/978-3-540-69731-2_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69572-1
Online ISBN: 978-3-540-69731-2
eBook Packages: Computer ScienceComputer Science (R0)