Evolutionary algorithms and gradient search: similarities anddifferences

Authors:
R. Salomon
Affiliations:
Dept. of Comput. Sci., Zurich Univ.
Venue:
IEEE Transactions on Evolutionary Computation
Year:
1998

Citing 0
Cited 28

An empirical study of non-binary genetic algorithm-based neural approaches for classification

ICIS '99 Proceedings of the 20th international conference on Information Systems
Recent approaches to global optimization problems through Particle Swarm Optimization

Natural Computing: an international journal
A Comparison of Evolution Strategies with Other Direct Search Methods in the Presence of Noise

Computational Optimization and Applications
Characterization of aggregate fuzzy membership functions using Saaty's eigenvalue approach

Computers and Operations Research
Sequential and multi-population memetic algorithms for assigning cells to switches in mobile networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
An empirical study of impact of crossover operators on the performance of non-binary genetic algorithm based neural approaches for classification

Computers and Operations Research
Real-coded memetic algorithms with crossover hill-climbing

Evolutionary Computation - Special issue on magnetic algorithms
A threshold-varying artificial neural network approach for classification and its application to bankruptcy prediction problem

Computers and Operations Research
A new optimization method: big bang-big crunch

Advances in Engineering Software
Weighted multirecombination evolution strategies

Theoretical Computer Science - Foundations of genetic algorithms
A framework for Visually Interactive Decision-making and Design using Evolutionary Multi-objective Optimization (VIDEO)

Environmental Modelling & Software
Improved and generalized learning strategies for dynamically fast and statistically robust evolutionary algorithms

Engineering Applications of Artificial Intelligence
Step length adaptation on ridge functions

Evolutionary Computation
Evolution strategies with cumulative step length adaptation on the noisy parabolic ridge

Natural Computing: an international journal
A gradient oriented recombination scheme for evolution strategies

Proceedings of the 2009 ACM symposium on Applied Computing
A new optimization method: Big Bang-Big Crunch

Advances in Engineering Software
Benchmarking CMA-EGS on the BBOB 2010 noiseless function testbed

Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
Benchmarking CMA-EGS on the BBOB 2010 noisy function testbed

Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
Deriving operating policies for multi-objective reservoir systems: Application of Self-Learning Genetic Algorithm

Applied Soft Computing
Noisy optimization: a theoretical strategy comparison of ES, EGS, SPSA & IF on the noisy sphere

Proceedings of the 13th annual conference on Genetic and evolutionary computation
Noise robustness by using inverse mutations

KI'05 Proceedings of the 28th annual German conference on Advances in Artificial Intelligence
Optimal weighted recombination

FOGA'05 Proceedings of the 8th international conference on Foundations of Genetic Algorithms
Directional distributions and their application to evolutionary algorithms

ICAISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Soft Computing
Simulation-based evolutionary method in antenna design optimization

Mathematical and Computer Modelling: An International Journal
Evolutionary approach to optimize the assignment of cells to switches in personal communication networks

Computer Communications
Assigning cells to switches in cellular mobile networks: a comparative study

Computer Communications
Artificial bee colony algorithm and pattern search hybridized for global optimization

Applied Soft Computing
A new multi-swarm multi-objective optimization method for structural design

Advances in Engineering Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

Classical gradient methods and evolutionary algorithms represent two very different classes of optimization techniques that seem to have very different properties. This paper discusses some aspects of some “obvious” differences and explores to what extent a hybrid method, the evolutionary-gradient-search procedure, can be used beneficially in the field of continuous parameter optimization. Simulation experiments show that on some test functions, the hybrid method yields faster convergence than pure evolution strategies, but that on other test functions, the procedure exhibits the same deficiencies as steepest-descent methods