Metraipolis › archive › dc_79fbcbc8ad8f
Differential evolution — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Differential_evolution
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-07T18:37:52.573Z
- SHA-256 of the archived text
2081a540f69d349aa334dc475f7d3676eeb6c1aaf91ebd3f51d6f0b9c3968036- Stable URL of this page
https://metraipolis.com/documento/dc_79fbcbc8ad8f
How to cite
Differential evolution — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Differential_evolution (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_79fbcbc8ad8f (Metraipolis archive dc_79fbcbc8ad8f, sha256 2081a540f69d349aa334dc475f7d3676eeb6c1aaf91ebd3f51d6f0b9c3968036)
BibTeX
@misc{dc79fbcbc8ad8f,
title = {Differential evolution — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Differential_evolution},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_79fbcbc8ad8f; sha256 2081a540f69d349aa334dc475f7d3676eeb6c1aaf91ebd3f51d6f0b9c3968036},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Differential_evolution. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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. DE is used for multidimensional real-valued functions but does not use the gradient of the problem being optimized, which means DE does not require the optimization problem to be differentiable, as is required by classic optimization methods such as gradient descent and quasi-newton methods. DE can therefore also be used on optimization problems that are not even continuous, are noisy, change over time, etc. DE optimizes a problem by maintaining a population of candidate solutions and creating new candidate solutions by combining existing ones according to its simple formulae, and then keeping whichever candidate solution has the best score or fitness on the optimization problem at hand. In this way, the optimization problem is treated as a black box that merely provides a measure of quality given a candidate solution and the gradient is therefore not needed. Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «mathematical optimization»). Fonte: Wikipedia in inglese, voce «Differential evolution» — https://en.wikipedia.org/wiki/Differential_evolution Wikidata Q2662197 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q2662197 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Differential_evolution?action=history). Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza. Estratto dell'introduzione non modificato nel contenuto; revisione 1378323788, consultata il 2026-10-07T18:04:07.672Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 1c6b48f6e35ccb86c31fb5e035d42f794a2a32001e741c300e83bf2615c11745