Live briefing
Everything about Differential evolution
Method of mathematical optimization
Differential evolution (DE) is an evolutionary algorithm to optimize a problem by iteratively trying to improve a candidate solution with regard to a given measure of quality. Such methods are commonly known as metaheuristics as they make few or no assumptions about the optimized problem and can search very large spaces of candidate solutions. However, metaheuristics such as DE do not guarantee an optimal solution is ever found. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Differential evolutionA 5-minute orientation
- Skim a recent paper: Differential evolution: A recent review based on state-of-the-art worksInfluential work since 2022
- Pick up a classic book: Weak and measure-valued solutions to evolutionary PDEsThe most-reprinted book on the subject
- Read the landmark paper: Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous SpacesCited 25,917 times
- Go sideways: Constrained optimizationA closely related topic
- Go sideways: Estimation of distribution algorithmA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces
Differential Evolution: A Survey of the State-of-the-Art
Opposition-Based Differential Evolution
Adaptive Distributed Differential Evolution
Gaussian Bare-Bones Differential Evolution
Compact Differential Evolution
Differential Evolution with DEoptim
Bare bones differential evolution
🆕 Influential since 2022
Differential evolution: A recent review based on state-of-the-art works
Distributed Differential Evolution With Adaptive Resource Allocation
Proximity ranking-based multimodal differential evolution
Parameter and strategy adaptive differential evolution algorithm based on accompanying evolution
A differential evolution algorithm based on accompanying population and piecewise evolution strategy
📚 Books worth reading
Weak and measure-valued solutions to evolutionary PDEsJosef Málek, J. Necas · 1996
Spectral theory for random and nonautonomous parabolic equations and applicationsJanusz Mierczynski, Wenxian Shen · 2008
Elementary stability and bifurcation theoryGérard Iooss, Gerard Iooss · 1980
Iterative splitting methods for differential equationsJuergen Geiser · 2011- 📕Nonlinear Evolution and Difference Equations of Monotone Type in Hilbert SpacesBehzad Djafari Rouhani · 2019
The Evolution Problem in General RelativitySergiu Klainerman, Francesco Nicolo · 2002
Systems of evolution equations with periodic and quasiperiodic coefficientsMitropolʹskiĭ, I͡U. A., Yuri A. Mitropolsky · 1992
Discovering evolution equations with applicationsMark A. McKibben · 2010
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Constrained optimization In mathematical optimization, constrained optimization (in some contexts called constraint optimization) is the process of optimizing an objective function…
- Estimation of distribution algorithm Estimation of distribution algorithms (EDAs), sometimes called probabilistic model-building genetic algorithms (PMBGAs), are stochastic optimization methods…
- Submodular set function In mathematics, a submodular set function (also known as a submodular function) is a set function that, informally, describes the relationship between…
- Function problem In computational complexity theory, a function problem is a computational problem where a single output is expected for every input, but the output is…
- Broyden–Fletcher–Goldfarb–Shanno algorithm In numerical optimization, the Broyden–Fletcher–Goldfarb–Shanno (BFGS) algorithm is an iterative method for solving unconstrained nonlinear optimization…
- Augmented Lagrangian method Augmented Lagrangian methods are a certain class of algorithms for solving constrained optimization problems. They have similarities to penalty methods…
- Penalty method In mathematical optimization, penalty methods are a certain class of algorithms for solving constrained optimization problems. A penalty method replaces…
- Nonlinear regression In statistics, nonlinear regression is a form of regression analysis in which observational data are modeled by a function which is a nonlinear combination…