The sample complexity of worst-case identification of FIR linear systems

DOI10.1016/0167-6911(93)90057-DzbMATH Open0769.93024MaRDI QIDQ1803842FDOQ1803842

Authors: Munther A. Dahleh, Theodore V. Theodosopoulos, John N. Tsitsiklis 

Publication date: 29 June 1993

Published in: Systems \& Control Letters (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 5773500
• scientific article; zbMATH DE number 806815
• Worst-case errors of linear algorithms for identification in H
• Optimality properties in finite sample l_i identification with bounded noise
• Worst-case identification in \(\ell_ 2\): Linear and nonlinear algorithms

zbMATH Keywords

finite impulse responsesample complexityworst-case identification

Mathematics Subject Classification ID

System identification (93B30) Linear systems in control theory (93C05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Control oriented system identification: a worst-case/deterministic approach in H/sub infinity /
• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimal algorithms theory for robust estimation and prediction
• Optimal asymptotic identification under bounded disturbances
• On the metric complexity of casual linear systems: ε -Entropy and ε -Dimension for continuous time
• Robust identification and Galois sequences
• Worst case system identification in \(\ell{}_ 1\): Optimal algorithms and error bounds
• Title not available (Why is that?)
• Linear and nonlinear algorithms for identification in H/sub infinity / with error bounds
• Title not available (Why is that?)
• Analysis of linear methods for robust identification in \(\ell_ 1\)
• Robust convergence of two-stage nonlinear algorithms for identification in \({\mathcal H}_ \infty\)

Cited In (24)

• Complexity of identification of linear systems with rational transfer functions
• On the sample-complexity of \({\mathcal H}_\infty\) identification
• Sample complexity of worst-case \(H^\infty\)-identification
• Worst-case identification in \(\ell_ 2\): Linear and nonlinear algorithms
• Estimation of model quality
• Finite time identification in unstable linear systems
• Title not available (Why is that?)
• Worst-case control-relevant identification
• The least-squares identification of FIR systems subject to worst-case noise
• Fractional covers for convolution products
• Analysis of linear methods for robust identification in \(\ell_ 1\)
• Closed-loop persistent identification of linear systems with unmodeled dynamics and stochastic disturbances
• Properties of least squares estimates in set membership identification
• Title not available (Why is that?)
• Necessary and sufficient conditions for robust identification of uncertain LTIstems
• On the optimal worst-case experiment design for constrained linear systems
• Worst-case identification of nonlinear fading memory systems
• Space and time complexities and sensor threshold selection in quantized identification
• On the worst-case divergence of the least-squares algorithm
• Convergence analysis of central and minimax algorithms in scalar regressor models
• Fast identification n-widths and uncertainty principles for LTI and slowly varying systems
• Uncertainty, information and complexity in identification and control
• Worst-case analysis of the least-squares method and related identification methods
• Modelling of uncertain systems via linear programming

This page was built for publication: The sample complexity of worst-case identification of FIR linear systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1803842)