2016 International Workshop on Computational Intelligence (IWCI) 2016
DOI: 10.1109/iwci.2016.7860370
|View full text |Cite
|
Sign up to set email alerts
|

Stability analysis of differential evolution

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 9 publications
(3 citation statements)
references
References 5 publications
0
3
0
Order By: Relevance
“…In this study, the mathematical stability analysis of HSOA is performed based on the presented approach by study of [90]. In this approach, the actual solution of problem x_m(n, t) can be considered as a Fourier series solution.…”
Section: Mathematical Framework For Stability Analysismentioning
confidence: 99%
“…In this study, the mathematical stability analysis of HSOA is performed based on the presented approach by study of [90]. In this approach, the actual solution of problem x_m(n, t) can be considered as a Fourier series solution.…”
Section: Mathematical Framework For Stability Analysismentioning
confidence: 99%
“…Finding amplification factor discussed in equation (18). As discussed in section 3.3, amplification factor is calculated by replacing each term x n l of the difference equation ( 15) by v n (k)e ι(kl∆i) and then using equation (16).…”
Section: Appendix Amentioning
confidence: 99%
“…However, a little work has been done in the area of stability analysis of this class of algorithms. Attempts have been made to analyse the stability behaviour of few algorithms which includes Particle Swarm Optimisation (PSO) algorithm using Z-transformation [20] [30] [36], Differential Evolution (DE) algorithm by using Lyapunov's stability theorem and von Neumann stability criterion [12] [18], Bacterial Foraging Optimization (BFO) algorithm using Lyapunov's stability condition and eigen value method [11] [9], Ant Colony Optimization (ACO) algorithm [1] and Gravitational Search algorithm (GSA) using passivity theorem and Lyapunov's stability condition [16].…”
Section: Introductionmentioning
confidence: 99%