Gradient evolution (GE) algorithm

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this chapter, a meta-heuristic optimization algorithm named gradient evolution (GE) is discussed, which is based on a gradient search method. First, the GE algorithm and the underlying idea are introduced and its applications in some studies are reviewed. Then, the mathematical formulation and a pseudo-code of GE are discussed. Finally, the conclusion is presented.

Cite

CITATION STYLE

APA

Abdi-Dehkordi, M., Bozorg-Haddad, O., & Chu, X. (2018). Gradient evolution (GE) algorithm. In Studies in Computational Intelligence (Vol. 720, pp. 117–130). Springer Verlag. https://doi.org/10.1007/978-981-10-5221-7_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free