Memetic Gradient Search
Authors:
- 1 June 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 1089778X,p. 2894-2901
Abstract
This paper reviews the different gradient-based schemes and the sources of gradient, their availability, precision and computational complexity, and explores the benefits of using gradient information within a memetic framework in the context of continuous parameter optimization, which is labeled here as memetic gradient search. In particular, we considered a quasi-Newton method with analytical gradient and finite differencing, as well as simultaneous perturbation stochastic approximation, used as the local searches. Empirical study on the impact of using gradient information showed that memetic gradient search outperformed the traditional GA and analytical, precise gradient brings considerable benefit to gradient-based local search (LS) schemes. Though gradient-based searches can sometimes get trapped in local optima, memetic gradient searches were still able to converge faster than the conventional GA.Keywords
This publication has 27 references indexed in Scilit:
- Hybrid evolutionary algorithm with Hermite radial basis function interpolants for computationally expensive adjoint solversComputational Optimization and Applications, 2007
- An Adaptive Multimeme Algorithm for Designing HIV Multidrug TherapiesIEEE/ACM Transactions on Computational Biology and Bioinformatics, 2007
- Wrapper–Filter Feature Selection Algorithm Using a Memetic FrameworkIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 2007
- Diversity-adaptive parallel memetic algorithm for solving large scale combinatorial optimization problemsSoft Computing, 2006
- Max-min surrogate-assisted evolutionary algorithm for robust designIEEE Transactions on Evolutionary Computation, 2006
- Aerodynamic design via control theoryJournal of Scientific Computing, 1988
- Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie1977
- Conditioning of Quasi-Newton Methods for Function MinimizationMathematics of Computation, 1970
- On a Numerical Instability of Davidon-Like MethodsMathematics of Computation, 1968
- Sequential Minimax Search for a MaximumProceedings of the American Mathematical Society, 1953