Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/mit-press/on-the-behaviour-of-the-1-es-for-conically-constrained-linear-problems-BfvlKtrOlA
References
References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.
- Publisher
- MIT Press
- Copyright
- © 2014 Massachusetts Institute of Technology
- ISSN
- 1063-6560
- eISSN
- 1530-9304
- DOI
- 10.1162/EVCO_a_00125
- pmid
- 24605845
- Publisher site
- See Article on Publisher Site
Abstract
We study the behaviour of a -ES that handles constraints by resampling infeasible candidate solutions for linear optimization problems with a conically constrained feasible region. The analysis generalizes prior work in that no particular orientation of the cone relative to the gradient of the objective function is assumed. Expressions that describe the strategy's single-step behaviour are derived. Assuming that the mutation strength is adapted in a scale-invariant manner, a simple zeroth-order model is used to determine the speed of convergence of the strategy. We then derive expressions that approximately characterize the average step size and convergence rate attained when using cumulative step size adaptation and compare the values with optimal ones.
Journal
Evolutionary Computation – MIT Press
Published: Sep 1, 2014
Keywords: Evolution strategies; constraint handling; cumulative step size adaptation