On the worst-case divergence of the least-squares algorithm
From MaRDI portal
Publication:1128512
DOI10.1016/S0167-6911(97)00093-5zbMath0902.93016OpenAlexW2169625855MaRDI QIDQ1128512
Publication date: 13 August 1998
Published in: Systems \& Control Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6911(97)00093-5
time-domain dataleast-squaresdivergenceFIR model structuresidentification in \({\mathcal H}_{\infty}\)
System identification (93B30) Least squares and related methods for stochastic control systems (93E24)
Related Items (3)
Unified set membership theory for identification, prediction and filtering of nonlinear systems ⋮ A generalization of a standard inequality for Hardy space \(H_1\) ⋮ \(H_{\infty}\) set membership identification: a survey
Cites Work
- Unnamed Item
- Unnamed Item
- Worst-case analysis of the least-squares method and related identification methods
- On covariance function tests used in system identification
- Worst case system identification in \(\ell{}_ 1\): Optimal algorithms and error bounds
- The modeling of uncertainty in control systems. Proceedings of the 1992 Santa Barbara Workshop held at the University of California, Santa Barbara, CA, USA, June 18-20, 1992
- The least squares algorithm, parametric system identification and bounded noise
- Worst-case identification in \(\ell_ 2\): Linear and nonlinear algorithms
- The least-squares identification of FIR systems subject to worst-case noise
- The sample complexity of worst-case identification of FIR linear systems
- Properties of least squares estimates in set membership identification
- Analysis of linear methods for robust identification in \(\ell_ 1\)
- Worst-case control-relevant identification
- Asymptotic variance expressions for identified black-box transfer function models
- Asymptotic properties of black-box identification of transfer functions
- Robust identification and Galois sequences
- Control oriented system identification: a worst-case/deterministic approach in H/sub infinity /
- On the time complexity of worst-case system identification
- Membership set estimators: size, optimal inputs, complexity and relations with least squares
- Optimality properties in finite sample li identification with bounded noise
- Least squares type algorithms for identification in the presence of modeling uncertainty
This page was built for publication: On the worst-case divergence of the least-squares algorithm