2018
DOI: 10.1016/j.aeue.2018.05.024
|View full text |Cite
|
Sign up to set email alerts
|

Meta-heuristic optimization algorithms for design of gain constrained state variable filter

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
4
1
1

Relationship

2
4

Authors

Journals

citations
Cited by 14 publications
(5 citation statements)
references
References 41 publications
0
5
0
Order By: Relevance
“…The penalty factor is required to be properly incorporated for violation of equality and inequality constraints. There are various types of penalty functions such as static, dynamic, annealing, adaptive, co-evolutionary, and death penalty [60]. The death penalty is the simple and low computational cost method.…”
Section: Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…The penalty factor is required to be properly incorporated for violation of equality and inequality constraints. There are various types of penalty functions such as static, dynamic, annealing, adaptive, co-evolutionary, and death penalty [60]. The death penalty is the simple and low computational cost method.…”
Section: Resultsmentioning
confidence: 99%
“…Optimization algorithm must have strong enough to solve the number of equalities and none qualities constraint problems. The brief reviews and formulation for solving the engineering optimization problems are discussed and detail can be found in the literature [32,33,[57][58][59][60][61][62][63][64][65][66].…”
Section: Engineering Problemsmentioning
confidence: 99%
See 1 more Smart Citation
“…Optimization algorithm must have strong enough to solve the number of equalities and none qualities constraint problems. The brief reviews and formulation for solving the engineering optimization problems are discussed and detail can be found in the literature [32,33,[57][58][59][60][61][62][63][64][65][66].…”
Section: Engineering Problemsmentioning
confidence: 99%
“…The rest of the paper is organized in the following manner: Section 2 proposes the Lens Law Optimization with complete mathematical model and update procedures of each particle in the course of iterations. The unimodal, multimodal and composite benchmark functions are considered for validation of proposed algorithm in Section 3 [50][51][52][53][54][55].Besides, the some engineering problems with number of constraints are considered to prove the effectiveness of proposed algorithms [55][56][57][58][59][60][61][62][63][64][65][66] The results obtained are presented and discussed in section-4. Section 5 presents the conclusion of the work.…”
Section: Introductionmentioning
confidence: 99%