# The classic differential evolution algorithm and its convergence properties

Roman Knobloch; Jaroslav Mlýnek; Radek Srb

Applications of Mathematics (2017)

- Volume: 62, Issue: 2, page 197-208
- ISSN: 0862-7940

## Access Full Article

top## Abstract

top## How to cite

topKnobloch, Roman, Mlýnek, Jaroslav, and Srb, Radek. "The classic differential evolution algorithm and its convergence properties." Applications of Mathematics 62.2 (2017): 197-208. <http://eudml.org/doc/287964>.

@article{Knobloch2017,

abstract = {Differential evolution algorithms represent an up to date and efficient way of solving complicated optimization tasks. In this article we concentrate on the ability of the differential evolution algorithms to attain the global minimum of the cost function. We demonstrate that although often declared as a global optimizer the classic differential evolution algorithm does not in general guarantee the convergence to the global minimum. To improve this weakness we design a simple modification of the classic differential evolution algorithm. This modification limits the possible premature convergence to local minima and ensures the asymptotic global convergence. We also introduce concepts that are necessary for the subsequent proof of the asymptotic global convergence of the modified algorithm. We test the classic and modified algorithm by numerical experiments and compare the efficiency of finding the global minimum for both algorithms. The tests confirm that the modified algorithm is significantly more efficient with respect to the global convergence than the classic algorithm.},

author = {Knobloch, Roman, Mlýnek, Jaroslav, Srb, Radek},

journal = {Applications of Mathematics},

keywords = {optimization; cost function; global minimum; global convergence; local convergence; differential evolution algorithm; optimal solution set; convergence in probability; numerical testing},

language = {eng},

number = {2},

pages = {197-208},

publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},

title = {The classic differential evolution algorithm and its convergence properties},

url = {http://eudml.org/doc/287964},

volume = {62},

year = {2017},

}

TY - JOUR

AU - Knobloch, Roman

AU - Mlýnek, Jaroslav

AU - Srb, Radek

TI - The classic differential evolution algorithm and its convergence properties

JO - Applications of Mathematics

PY - 2017

PB - Institute of Mathematics, Academy of Sciences of the Czech Republic

VL - 62

IS - 2

SP - 197

EP - 208

AB - Differential evolution algorithms represent an up to date and efficient way of solving complicated optimization tasks. In this article we concentrate on the ability of the differential evolution algorithms to attain the global minimum of the cost function. We demonstrate that although often declared as a global optimizer the classic differential evolution algorithm does not in general guarantee the convergence to the global minimum. To improve this weakness we design a simple modification of the classic differential evolution algorithm. This modification limits the possible premature convergence to local minima and ensures the asymptotic global convergence. We also introduce concepts that are necessary for the subsequent proof of the asymptotic global convergence of the modified algorithm. We test the classic and modified algorithm by numerical experiments and compare the efficiency of finding the global minimum for both algorithms. The tests confirm that the modified algorithm is significantly more efficient with respect to the global convergence than the classic algorithm.

LA - eng

KW - optimization; cost function; global minimum; global convergence; local convergence; differential evolution algorithm; optimal solution set; convergence in probability; numerical testing

UR - http://eudml.org/doc/287964

ER -

## References

top- Hu, Z., Xiong, S., Su, Q., Zhang, X., 10.1155/2013/193196, J. Appl. Math. 2013 (2013), Article ID 139196, 14 pages. (2013) MR3122108DOI10.1155/2013/193196
- Mlýnek, J., Knobloch, R., Srb, R., 10.1063/1.4936696, AIP Conference Proceedings 1690 AIP Publishing, Melville (2015), Article No. 020018, 8 pages. DOI10.1063/1.4936696
- Mlýnek, J., Knobloch, R., Srb, R., 10.7148/2016-0425, ECMS 2016 Proceedings, 30th European Conference on Modelling and Simulation Regensburg, Germany (2016), 425-431. (2016) MR3203813DOI10.7148/2016-0425
- Price, K. V., 10.1109/NAFIPS.1996.534790, Proceedings of North American Fuzzy Information Processing Berkeley (1996), 524-527. (1996) DOI10.1109/NAFIPS.1996.534790
- Price, K. V., Storn, R. M., Lampien, J. A., 10.1007/3-540-31306-0, Natural Computing Series. Springer, Berlin (2005). (2005) Zbl1186.90004MR2191377DOI10.1007/3-540-31306-0
- Simon, D., Evolutionary Optimization Algorithms. Biologically Inspired and Population-Based Approaches to Computer Intelligence, John Wiley & Sons, Hoboken (2013). (2013) Zbl1280.68008MR3362741
- Storn, R. M., Price, K. V., 10.1023/A:1008202821328, J. Glob. Optim. 11 (1997), 341-359. (1997) Zbl0888.90135MR1479553DOI10.1023/A:1008202821328

## Citations in EuDML Documents

top## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.