Sufficient conditions for global convergence of differential evolution algorithm (Q1789781): Difference between revisions
From MaRDI portal
Removed claims |
Created claim: Wikidata QID (P12): Q59002035, #quickstatements; #temporary_batch_1710970253704 |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: ZhongBo Hu / rank | |||
Normal rank | |||
Property / author | |||
Property / author: ShengWu Xiong / rank | |||
Normal rank | |||
Property / author | |||
Property / author: QingHua Su / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1155/2013/193196 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1965082149 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q59002035 / rank | |||
Normal rank |
Latest revision as of 22:42, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Sufficient conditions for global convergence of differential evolution algorithm |
scientific article |
Statements
Sufficient conditions for global convergence of differential evolution algorithm (English)
0 references
10 October 2018
0 references
Summary: The differential evolution algorithm (DE) is one of the most powerful stochastic real-parameter optimization algorithms. The theoretical studies on DE have gradually attracted the attention of more and more researchers. However, few theoretical researches have been done to deal with the convergence conditions for DE. In this paper, a sufficient condition and a corollary for the convergence of DE to the global optima are derived by using the infinite product. A DE algorithm framework satisfying the convergence conditions is then established. It is also proved that the two common mutation operators satisfy the algorithm framework. Numerical experiments are conducted on two parts. One aims to visualize the process that five convergent DE based on the classical DE algorithms escape from a local optimal set on two low dimensional functions. The other tests the performance of a modified DE algorithm inspired of the convergent algorithm framework on the benchmarks of the CEC2005.
0 references