We propose and test the performance of an implicit strat- egy to handle box, linear and quadratic convex constraints, based on changing the search space from points to direc- tions, suitable to be easily implemented in combination with differential evolution (DE) algorithms for the boundary op- timization of a generic continuous function. In particular, we see that DE can be efciently implemented to nd so- lutions on the boundary of box constraints, linear inequal- ity constraints and quadratic convex constraints, for which the feasible set is convex and bounded. The computational results are performed on different classes of minimization problems.
M. Spadoni, L. Stefanini (2009). Handling Box, Linear and Quadratic-Convex Constraints for Boundary Optimization with Differential Evolution Algorithms. s.l : IEEE Computer Society.
Handling Box, Linear and Quadratic-Convex Constraints for Boundary Optimization with Differential Evolution Algorithms
SPADONI, MASSIMO;
2009
Abstract
We propose and test the performance of an implicit strat- egy to handle box, linear and quadratic convex constraints, based on changing the search space from points to direc- tions, suitable to be easily implemented in combination with differential evolution (DE) algorithms for the boundary op- timization of a generic continuous function. In particular, we see that DE can be efciently implemented to nd so- lutions on the boundary of box constraints, linear inequal- ity constraints and quadratic convex constraints, for which the feasible set is convex and bounded. The computational results are performed on different classes of minimization problems.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
