On the Behaviour of the (1+1)-ES for a Simple Constrained Problem

  • Authors:
  • Dirk V. Arnold;Daniel Brauer

  • Affiliations:
  • Faculty of Computer Science, Dalhousie University, Halifax, Canada B3H 1W5;Faculty of Computer Science, Dalhousie University, Halifax, Canada B3H 1W5

  • Venue:
  • Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper studies the behaviour of the (1 + 1)-ES when applied to a linear problem with a single linear constraint. It goes beyond previous work by considering constraint planes that do not contain the gradient direction. The behaviour of the distance of the search point from the constraint plane forms a Markov chain. The limit distribution of that chain is approximated using an exponential model, and progress rates and success probabilities are derived. Consequences for the working of step length adaptation mechanisms based on success probabilities are discussed.