Gradient Evolution (GE) Algorithm
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.
- Bazaraa, M. S., Sherali, H. D., & Shetty, C. M. (2013). Nonlinear programming: Theory and algorithms (3rd ed.). New Jersey, USA: Wiley.Google Scholar
- Kuo, R. J., & Zulvia, F. E. (2016, July 25–29). Cluster analysis using a gradient evolution-based k-means algorithm. In IEEE congress on evolutionary computation (CEC). Beijing, China: Peking University.Google Scholar
- Larson, R., Hostetler, R. P., & Edwards, B. H. (2007). Essential Calculus: Early Transcendental Functions (1st ed.). New York, USA: Houghton Mifflin Company.Google Scholar
- Miller, H. R. (2011). Optimization: Foundations and applications (1st ed.) New York, USA: Wiley.Google Scholar
- Patil, P. B., & Verma, U. P. (2006). Numerical computational methods (1st ed.). Oxford, UK: Alpha Science International.Google Scholar