A merit function approach for evolution strategies
From MaRDI portal
Publication:6114898
DOI10.1016/j.ejco.2020.100001zbMath1530.90100arXiv1804.11111OpenAlexW3118759495MaRDI QIDQ6114898
Publication date: 12 July 2023
Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.11111
global convergenceconstrained optimizationmerit functionderivative-free optimizationevolution strategy
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Globally convergent evolution strategies
- Globally convergent evolution strategies for constrained optimization
- Test examples for nonlinear programming codes
- Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art
- A progressive barrier derivative-free trust-region algorithm for constrained optimization
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- A parallel evolution strategy for an Earth imaging problem in geophysics
- Constrained derivative-free optimization on thin domains
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- Algorithm 909
- Introduction to Derivative-Free Optimization
- Optimization and nonsmooth analysis
- Derivative-Free and Blackbox Optimization
- Benchmarking Derivative-Free Optimization Algorithms
- A Progressive Barrier for Derivative-Free Nonlinear Programming
- A Merit Function Approach for Direct Search
- Optimality Measures for Performance Profiles
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- Nonlinear programming without a penalty function.
This page was built for publication: A merit function approach for evolution strategies