2017 International Conference on Control, Automation and Diagnosis (ICCAD) 2017
DOI: 10.1109/cadiag.2017.8075705
|View full text |Cite
|
Sign up to set email alerts
|

Parametric complexity reduction of the Meixner-like model using genetic algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 21 publications
0
2
0
Order By: Relevance
“…The optimization problem of the pole in the Meixner-like model was addressed by Maraoui et al (2016a, 2016b) using gradient and Newton-Raphson type iterative algorithms that deal with black box context where only the response of the system to a persistently exciting input signal is known. Also, a method based on Genetic algorithms is proposed, in Maraoui and Bouzrara (2017), to optimize the Meixner-like pole.…”
Section: Optimization Of the Poles And The Generalization Orders Of Tmentioning
confidence: 99%
See 1 more Smart Citation
“…The optimization problem of the pole in the Meixner-like model was addressed by Maraoui et al (2016a, 2016b) using gradient and Newton-Raphson type iterative algorithms that deal with black box context where only the response of the system to a persistently exciting input signal is known. Also, a method based on Genetic algorithms is proposed, in Maraoui and Bouzrara (2017), to optimize the Meixner-like pole.…”
Section: Optimization Of the Poles And The Generalization Orders Of Tmentioning
confidence: 99%
“…To ensure the reduction of the model coefficient number, the parameters characterizing the Meixner-like functions have to be optimized. To do so, we propose to optimize the Meixner-like poles by using Genetic algorithms that are widely adopted in recent years and that are very powerful in stochastic system modeling (Akbari and Ziarati, 2011; Maraoui and Bouzrara, 2017; Zhang et al, 2007). The processing of these algorithms can converge to the global optimum with a high probability.…”
Section: Introductionmentioning
confidence: 99%