2015
DOI: 10.1007/s10589-015-9747-3
|View full text |Cite
|
Sign up to set email alerts
|

Globally convergent evolution strategies for constrained optimization

Abstract: In this paper we propose, analyze, and test algorithms for constrained optimization when no use of derivatives of the objective function is made. The proposed methodology is built upon the globally convergent evolution strategies previously introduced by the authors for unconstrained optimization. Two approaches are encompassed to handle the constraints. In a first approach, feasibility is first enforced by a barrier function and the objective function is then evaluated directly at the feasible generated point… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
24
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
8

Relationship

3
5

Authors

Journals

citations
Cited by 18 publications
(24 citation statements)
references
References 47 publications
0
24
0
Order By: Relevance
“…However, ES have proven successful in solving non-convex optimization problems, e.g. [35], as well as in the global optimization of constraint problems [36]. This motivates the use of ES in the optimization problem presented here.…”
Section: B Evolution Strategiesmentioning
confidence: 97%
“…However, ES have proven successful in solving non-convex optimization problems, e.g. [35], as well as in the global optimization of constraint problems [36]. This motivates the use of ES in the optimization problem presented here.…”
Section: B Evolution Strategiesmentioning
confidence: 97%
“…f (x (l) ) is set to the value of the objective function at the iteration l if x (l) satisfies the constraints, and set to +∞ otherwise. We note that we had to adapt the data profiles [40] to our constrained setting; for that reason, we are using the same convergence test as proposed in [41].…”
Section: Data Profilesmentioning
confidence: 99%
“…A maximum value on the velocity model of m max = 4500m/s has been also imposed to avoid propagation by meaningless velocity models. Both requirements were guaranteed by projecting the offspring models onto the feasible domain defined by the bounds, an approach that has been shown to be globally convergent in [17]. Since there are no other constraints rather than simple bounds on the variables one can use the simple orthogonal 2 -projection.…”
Section: A Modified Cma-esmentioning
confidence: 99%