Gradient subspace approximation: a direct search method for memetic computing

The hybridization of evolutionary algorithms and local search techniques as, e.g., mathematical programming techniques, also referred to as memetic algorithms, has caught the interest of many researchers in the recent past. Reasons for this include that the resulting algorithms are typically robust...

Full description

Saved in:

Bibliographic Details
Published in:	Soft computing (Berlin, Germany) Vol. 21; no. 21; pp. 6331 - 6350
Main Authors:	Schütze, Oliver, Alvarado, Sergio, Segura, Carlos, Landa, Ricardo
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.11.2017 Springer Nature B.V
Subjects:	Algorithms Approximation Artificial Intelligence Computational Intelligence Control Engineering Evolutionary algorithms Evolutionary computation Heuristic Mathematical Logic and Foundations Mathematical programming Mechatronics Methodologies and Application Neighborhoods Optimization Robotics Robustness (mathematics) Search methods Memetic computing Differential evolution Direct search Evolutionary algorithms Scalar optimization
ISSN:	1432-7643, 1433-7479
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!