A convergence theorem for a class of stochastic gradient type algorithms with application to robust system identification
2006
The recursive algorithms of stochastic gradient type for estimating the parameters of linear discrete-time systems in the presence of disturbance uncertainty has been considered in the paper. Problems related to the construction of min-max optimal recursive algorithms are demonstrated. In addition, the robustness of the proposed algorithms has been addressed. Since the min-max optimal solution cannot be achieved in practice, a simple procedure for constructing a practically applicable robustified recursive algorithm based on a suitable nonlinear transformation of the prediction error and convenient approximations is suggested. The convergence of the robustified recursive algorithm is established theoretically using the martingale theory.
Keywords:
- Mathematical optimization
- Martingale (probability theory)
- Convergence (routing)
- Control theory
- Recursion (computer science)
- Robustness (computer science)
- Estimation theory
- System identification
- Recursion
- Algorithm
- Nonlinear system
- Mathematics
- Computer science
- Mean squared prediction error
- recursive algorithms
- nonlinear transformation
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
16
References
0
Citations
NaN
KQI