Authors: Jägersküpper, Jens
Title: Analysis of a Simple Evolutionary Algorithm for the Minimization in Euclidian Spaces
Language (ISO): en
Abstract: Although evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on expected runtimes and success probabilities are limited to discrete search spaces. In practice, however, EAs are mostly used for continuous optimization problems. First results on the expected runtime of a simple, but fundamental EA minimizing a symmetric polynomial of degree two in Rn are presented. Namely, the so-called (1+1) evolution strategy ((1+1) ES) minimizing the SPHERE function is investigated. A lower bound on the expected runtime is shown that is valid for any m
URI: http://hdl.handle.net/2003/5426
http://dx.doi.org/10.17877/DE290R-7840
Issue Date: 2003-06-04
Publisher: Universität Dortmund
Appears in Collections:Sonderforschungsbereich (SFB) 531

Files in This Item:
File Description SizeFormat 
140.pdfDNB732.57 kBAdobe PDFView/Open
140.ps491.45 kBPostscriptView/Open


This item is protected by original copyright



All resources in the repository are protected by copyright.