2013 9th Asian Control Conference (ASCC) 2013
DOI: 10.1109/ascc.2013.6606120
|View full text |Cite
|
Sign up to set email alerts
|

Gradient based iterative identification for discrete-time delay systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2015
2015
2017
2017

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 22 publications
0
1
0
Order By: Relevance
“…Since the cost function J 2 (d) has the rounding propriety see Bedoui et al (2013a), the minimizing of (12) is equivalent to minimizing the following problem: The negative gradient search method is then used to estimate the parameter vectorθ (k) and the time delayd(k). Solving the optimization problem (11) leads to the following algorithm of computing of θ (k):…”
Section: The Hierarchical Gradient Based Algorithmmentioning
confidence: 99%
“…Since the cost function J 2 (d) has the rounding propriety see Bedoui et al (2013a), the minimizing of (12) is equivalent to minimizing the following problem: The negative gradient search method is then used to estimate the parameter vectorθ (k) and the time delayd(k). Solving the optimization problem (11) leads to the following algorithm of computing of θ (k):…”
Section: The Hierarchical Gradient Based Algorithmmentioning
confidence: 99%