Analysis of a Simple Evolutionary Algorithm for the Minimization in Euclidian Spaces

dc.contributor.author	Jägersküpper, Jens	de
dc.date.accessioned	2004-12-07T08:21:12Z
dc.date.available	2004-12-07T08:21:12Z
dc.date.issued	2003-06-04	de
dc.description.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	de
dc.format.extent	503247 bytes
dc.format.extent	750152 bytes
dc.format.mimetype	application/pdf
dc.format.mimetype	application/postscript
dc.identifier.uri	http://hdl.handle.net/2003/5426
dc.identifier.uri	http://dx.doi.org/10.17877/DE290R-7840
dc.language.iso	en	de
dc.publisher	Universität Dortmund	de
dc.relation.ispartofseries	Reihe Computational Intelligence ; 140	de
dc.subject.ddc	000	de
dc.title	Analysis of a Simple Evolutionary Algorithm for the Minimization in Euclidian Spaces	en
dc.type	Text	de
dc.type.publicationtype	report
dcterms.accessRights	open access

Files

Now showing 1 - 2 of 2