The sample complexity of worst-case identification of FIR linear systems
type: Item
instance of: scholarly article
title: The sample complexity of worst-case identification of FIR linear systems
zbMATH Open document ID: 0769.93024
DOI: 10.1016/0167-6911(93)90057-D
author: Munther A. Dahleh
author: Theodore V. Theodosopoulos
author: John N. Tsitsiklis
published in: Systems \& Control Letters
publication date: 1993-06-29T00:00:00Z
Mathematics Subject Classification ID: 93B30
Mathematics Subject Classification ID: 93C05
zbMATH DE Number: 221958
zbMATH Keywords: worst-case identification
zbMATH Keywords: sample complexity
zbMATH Keywords: finite impulse response
MaRDI profile type: Publication
cites work: Q5671986
cites work: Q3686615
cites work: Robust convergence of two-stage nonlinear algorithms for identification in \({\mathcal H}_ \infty\)
cites work: Linear and nonlinear algorithms for identification in H/sub infinity / with error bounds
cites work: Control oriented system identification: a worst-case/deterministic approach in H/sub infinity /
cites work: Q3356164
cites work: Worst case system identification in \(\ell{}_ 1\): Optimal algorithms and error bounds
cites work: Robust identification and Galois sequences
cites work: Analysis of linear methods for robust identification in \(\ell_ 1\)
cites work: Optimal algorithms theory for robust estimation and prediction
cites work: Q3352944
cites work: Q3883494
cites work: Q3993279
cites work: Optimal asymptotic identification under bounded disturbances
cites work: On the metric complexity of casual linear systems: ε -Entropy and ε -Dimension for continuous time
description: scientific article; zbMATH DE number 221958