Theory of Evolution Strategies: A New Perspective

[1]  Anne Auger,et al.  Log-Linear Convergence and Divergence of the Scale-Invariant (1+1)-ES in Noisy Environments , 2011, Algorithmica.

[2]  Jens Jägersküpper,et al.  Aiming for a theoretically tractable CSA variant by means of empirical investigations , 2008, GECCO '08.

[3]  Jens Jägersküpper,et al.  Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods General Lower Bounds for Randomized Direct Search with Isotropic Sampling , 2008 .

[4]  A. A. Zhigli︠a︡vskiĭ,et al.  Stochastic Global Optimization , 2007 .

[5]  Anne Auger,et al.  Log-Linear Convergence and Optimal Bounds for the (1+1)-ES , 2007, Artificial Evolution.

[6]  Anne Auger,et al.  Reconsidering the progress rate theory for evolution strategies in finite dimensions , 2006, GECCO '06.

[7]  A. Tikhomirov.  On the Markov homogeneous optimization method , 2006 .

[8]  Anne Auger,et al.  Convergence results for the (1, lambda)-SA-ES using the theory of phi-irreducible Markov chains , 2005, Theor. Comput. Sci..

[9]  Jens Jägersküpper,et al.  Rigorous Runtime Analysis of the (1+1) ES: 1/5-Rule and Ellipsoidal Fitness Landscapes , 2005, FOGA.

[10]  Petros Koumoutsakos,et al.  Learning probability distributions in continuous evolutionary algorithms – a comparative review , 2004, Natural Computing.

[11]  Olivier François,et al.  Global convergence for evolution strategies in spherical problems: some simple proofs and difficulties , 2003, Theor. Comput. Sci..

[12]  Jens Jägersküpper,et al.  Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces , 2003, ICALP.

[13]  L. Devroye,et al.  Random Search Under Additive Noise , 2002 .

[14]  Günter Rudolph,et al.  Self-adaptive mutations may lead to premature convergence , 2001, IEEE Trans. Evol. Comput..

[15]  Nikolaus Hansen,et al.  Completely Derandomized Self-Adaptation in Evolution Strategies , 2001, Evolutionary Computation.

[16]  Garrison W. Greenwood,et al.  Convergence in Evolutionary Programs with Self-Adaptation , 2001, Evolutionary Computation.

[17]  G. W. Stewart,et al.  On sublinear convergence , 1995 .

[18]  V. Nekrutkin,et al.  Speed of convergence as a function of given accuracy for random search methods , 1993 .

[19]  Richard L. Tweedie,et al.  Markov Chains and Stochastic Stability , 1993, Communications and Control Engineering Series.

[20]  A. A. Zhigli︠a︡vskiĭ,et al.  Theory of Global Random Search , 1991 .

[21]  Hans-Paul Schwefel,et al.  Numerical Optimization of Computer Models , 1982 .

[22]  R. C. White.  A survey of random methods for parameter optimization , 1971 .

[23]  K. Steiglitz,et al.  Adaptive step size random search , 1968 .

[24]  Samuel H. Brooks.  A Discussion of Random Methods for Seeking Maxima , 1958 .