Refine
Year of publication
Document Type
- Article (21)
- Conference Proceeding (20)
- Book (4)
- Part of a Book (2)
- Working Paper (2)
- Report (1)
Institute
Is part of the Bibliography
- yes (50) (remove)
Keywords
- Evolution strategy (7)
- self-adaptation (4)
- Evolution Strategies (3)
- Evolution strategies (3)
- Global optimization (3)
- Optimization (3)
- Rastrigin function (3)
- evolution strategies (3)
- mutation strength (3)
- Artificial Intelligence (incl. Robotics) (2)
- Constrained Optimization (2)
- Constrained optimization (2)
- Covariance matrices (2)
- Mathematical model (2)
- Progress rate (2)
- Vectors (2)
- conically constrained problem (2)
- elliptic constraint (2)
- hyperbolic constraint (2)
- linear programming (2)
- meta-es (2)
- parabolic constraint (2)
- portfolio optimization (2)
- progress rate (2)
- repair by projection (2)
- Active matrix adaptation evolution strategy (1)
- Algorithm Analysis and Problem Complexity (1)
- Algorithm comparison (1)
- Algorithm design and analysis (1)
- Analytical models (1)
- Approximation methods (1)
- Benchmarking (1)
- Black-box optimization benchmarking (1)
- CMSA-ES (1)
- Computation by Abstract Devices (1)
- Computational Biology/Bioinformatics (1)
- Computational Intelligence (1)
- Computing methodologies (1)
- Conically constrained problem (1)
- Constraint Handling (1)
- Constraint optimization (1)
- Constraints (1)
- Continuous mathematics (1)
- Covariance matrix (1)
- Covariance matrix adaptation (1)
- Discrete Mathematics in Computer Science (1)
- Dow Jones Index (1)
- Electronic mail (1)
- Ellipsoid model (1)
- Ellipsoids (1)
- Evolution (biology) (1)
- Evolutionary Algorithms (1)
- Evolutionary algorithms (1)
- Gaussian distribution (1)
- HappyCat (1)
- Linear programming (1)
- Manganese (1)
- Mathematics of computing (1)
- Matrix adaptation evolution strategy (1)
- Meta evolution strategies (1)
- Minimization (1)
- Mutation strength adaptation (1)
- Nanotechnology (1)
- Noisy optimization (1)
- Pattern Recognition (1)
- Portfolios (1)
- Progress rate analysis (1)
- Quantum Information Technology, Spintronics (1)
- Ray-ES algorithm (1)
- Repair by projection (1)
- Rotated Klee-Minty Problem (1)
- Search problems (1)
- Standards (1)
- Stochastic gradient approximation (1)
- Systems Biology (1)
- Theoretical Analysis (1)
- Theory of Computation (1)
- Time complexity (1)
- Upper bound (1)
- ad hoc networks (1)
- ad hoc optimization approach (1)
- adaptation (1)
- adaption (1)
- algorithm engineering (1)
- algorithms and complexity (1)
- cardinality constraint (1)
- concave programming (1)
- constrained optimization (1)
- constrained optimization problems (1)
- constraint covariance matrix self-adaptation evolution strategy design (1)
- constraint handling (1)
- constraint handling by repair (1)
- covariance matrices (1)
- covariance matrix self-adaptation evolution strategy (1)
- cumulative step size adaptation (1)
- differential evolution (1)
- dynamical systems approach (1)
- ellipsoid model (1)
- elliptic model (1)
- evolution strategy (1)
- evolutionary algorithms (1)
- evolutionary computation (1)
- fitness noise (1)
- global convergence (1)
- global optimization (1)
- intermediate recombination (1)
- investment (1)
- linear inequalities (1)
- machine learning (1)
- matrix adaptation evolution strategy (1)
- meta-evolution strategy (1)
- mixed linear-nonlinear constrained optimization problem (1)
- multi-modal objective function (1)
- noisy ellipsoid model (1)
- nonconvex optimization (1)
- nonconvex optimization problem (1)
- nonlinear constraint (1)
- nonlinear programming (1)
- optimization (1)
- population size (1)
- population size control (1)
- population sizing (1)
- real-parameter optimization problem (1)
- sharp ridge function (1)
- soft computing (1)
- sphere model (1)
- theoretical analysis (1)
- time series (1)
- time series data (1)
A modified matrix adaptation evolution strategy with restarts for constrained real-world problems
(2020)
In combination with successful constraint handling techniques, a Matrix Adaptation Evolution Strategy (MA-ES) variant (the εMAg-ES) turned out to be a competitive algorithm on the constrained optimization problems proposed for the CEC 2018 competition on constrained single objective real-parameter optimization. A subsequent analysis points to additional potential in terms of robustness and solution quality. The consideration of a restart scheme and adjustments in the constraint handling techniques put this into effect and simplify the configuration. The resulting BP-εMAg-ES algorithm is applied to the constrained problems proposed for the IEEE CEC 2020 competition on Real-World Single-Objective Constrained optimization. The novel MA-ES variant realizes improvements over the original εMAg-ES in terms of feasibility and effectiveness on many of the real-world benchmarks. The BP-εMAg-ES realizes a feasibility rate of 100% on 44 out of 57 real-world problems and improves the best-known solution in 5 cases.
A multi-recombinative active matrix adaptation evolution strategy for constrained optimization
(2019)