On the behaviour of the (1, λ)-ES for conically constrained linear problems
1Faculty of Computer Science, Dalhousie University, Halifax, Nova Scotia, Canada B3H 4R2 dirk@cs.dal.ca.
Abstract:
We study the behaviour of a [Formula: see text]-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.
Related Concept Videos
Application of Nonlinear Inequalities
Equation of the Elastic Curve
Consider a cantilever beam with a point load at its free end (for instance, a diving board). When analyzing beam deflection with small slopes, the shape of the beam's elastic curve becomes key. The governing equation for this analysis involves the bending moment and the beam's flexural rigidity,...
Introduction to Nonlinear Inequalities
Constraints and Statical Determinacy
Gaussian Elimination: Problem Solving
General Case of Eccentric Axial Loading
Consider a member subjected to equal and opposite forces that are applied along a line that does not coincide with the member's neutral axis. In unsymmetrical...


