1996
DOI: 10.1016/0005-1098(95)00172-7
|View full text |Cite
|
Sign up to set email alerts
|

On the identifiability of the time delay with least-squares methods

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
29
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 30 publications
(29 citation statements)
references
References 7 publications
0
29
0
Order By: Relevance
“…The optimization procedure minimized the objective function using the Levenberg-Marquardt algorithm (Moré, 1978), implemented with MATLAB's lsqcurvefit function (MATLAB, MathWorks, Natick, MA, USA). To avoid convergence problems associated with parameter optimization in time-delayed dynamical systems, we visually estimated each trial's time delay rather than treating it as a parameter to be optimized (Ferretti et al, 1996;Müller et al, 2003).…”
Section: Discussionmentioning
confidence: 99%
“…The optimization procedure minimized the objective function using the Levenberg-Marquardt algorithm (Moré, 1978), implemented with MATLAB's lsqcurvefit function (MATLAB, MathWorks, Natick, MA, USA). To avoid convergence problems associated with parameter optimization in time-delayed dynamical systems, we visually estimated each trial's time delay rather than treating it as a parameter to be optimized (Ferretti et al, 1996;Müller et al, 2003).…”
Section: Discussionmentioning
confidence: 99%
“…In addition, the choice of the model structure (order and time delay) and the parameter estimation are two basic elements in the identification problem. Therefore, lots of works that used various methods to estimate the time delay and the order model have been published in the literature [15][16][17][18][19][20][21][22][23][24][25][26][27][28].…”
Section: Preliminary Studymentioning
confidence: 99%
“…However, it is assumed to be negligible in several researches, in order to simplify the study. To overcome this assumption, a variety of algorithms are introduced into the time-delay estimation, in order to improve the precision and the convergence in the modeling, identification, and control processes [23][24][25][26][27][28]. The time-delay identification is a greatly studied problem with several works in the literature.…”
Section: Time-delay Estimationmentioning
confidence: 99%
“…The time-delay is a continuous parameter, and all parameters are estimated by a prediction error/maximum likelihood method, using iterative search [23]. It is well known that the objective function may have many local minima in this case, [8,26,29], so the initialization of the parameters must be done with great care. Here we use an initialization method implemented in [24], based on ARXS (see below), followed by a global search for best time delay and model zero for fixed poles, followed by local Gauss-Newton search for all free parameters.…”
Section: 23mentioning
confidence: 99%
“…Here we use an initialization method implemented in [24], based on ARXS (see below), followed by a global search for best time delay and model zero for fixed poles, followed by local Gauss-Newton search for all free parameters. Other ideas how to handle the problem of local minima are described in [8].…”
Section: 23mentioning
confidence: 99%