Analysis of linear methods for robust identification in \(\ell_ 1\)
From MaRDI portal
Publication:1894437
DOI10.1016/0005-1098(94)00163-DzbMath0823.93017OpenAlexW2053369714WikidataQ56319498 ScholiaQ56319498MaRDI QIDQ1894437
Pertti M. Mäkilä, Jonathan R. Partington
Publication date: 23 October 1995
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0005-1098(94)00163-d
Sensitivity (robustness) (93B35) System identification (93B30) Linear systems in control theory (93C05)
Related Items
Robust system identification with noisy experimental data: Projection operator and linear algorithms, Identification in \({\mathcal H}_ \infty\) using Pick's interpolation, Worst-case identification of nonlinear fading memory systems, On robustness in control and LTI identification: near-linearity and non-conic uncertainty, Modelling of uncertain systems via linear programming, Subspace-based identification of infinite-dimensional multivariable systems from frequency-response data, On the worst-case divergence of the least-squares algorithm, On the sample-complexity of ?? identification, Rejection of persistent bounded disturbances: Nonlinear controllers, Worst-case identification in Banach spaces, The sample complexity of worst-case identification of FIR linear systems, Identification and adaptive control: Towards a complexity-based general theory
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
- Robust identification in \(H_{\infty{}}\)
- Worst case system identification in \(\ell{}_ 1\): Optimal algorithms and error bounds
- 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
- Robust identification and Galois sequences
- On the time complexity of worst-case system identification
- Worst-case analysis of identification-BIBO robustness for closed-loop data
- Interpolation in Normed Spaces from the Values of Linear Functionals