On the time complexity of worst-case system identification

DOI10.1109/9.284870MaRDI QIDQ4307411zbMATH OpenOpenAlexFDO

Authors Ashok Tikku, Kameshwar Poolla

Publication date 28 September 1994

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/9.284870

zbMATH Keywords

minimum duration identification experimentnoisesystem modeling uncertaintyworst-case system identification

Mathematics Subject Classification ID

Control/observation systems with incomplete information (93C41) Time-scale analysis and singular perturbations in control/observation systems (93C70) Identification in stochastic control theory (93E12)

Recommendations

• scientific article; zbMATH DE number 522873
• scientific article; zbMATH DE number 5773500
• Worst case system identification in \(\ell{}_ 1\): Optimal algorithms and error bounds

Cited in

(26)

• On the worst-case divergence of the least-squares algorithm
• Identification and adaptive control: Towards a complexity-based general theory
• Complexity of identification of linear systems with rational transfer functions
• Worst-case identification in \(\ell_ 2\): Linear and nonlinear algorithms
• Worst case identification of continuous time systems via interpolation
• Sample complexity of worst-case H^-identification
• Closed-loop persistent identification of linear systems with unmodeled dynamics and stochastic disturbances
• Worst-case identification of nonlinear fading memory systems
• Analysis of linear methods for robust identification in \(\ell_ 1\)
• Estimation of model quality
• Worst-case control-relevant identification
• Modelling of uncertain systems via linear programming
• Fractional covers for convolution products
• Input design in worst-case system identification with quantized measurements
• On the optimal worst-case experiment design for constrained linear systems
• Necessary and sufficient conditions for robust identification of uncertain LTIstems
• Space and time complexities and sensor threshold selection in quantized identification
• Uncertainty, information and complexity in identification and control
• On the sample-complexity of \({\mathcal H}_\infty\) identification
• scientific article; zbMATH DE number 5773500 (Why is no real title available?)
• Fast identification n-widths and uncertainty principles for LTI and slowly varying systems
• Robust noise attenuation under stochastic noises and worst-case unmodelled dynamics
• Worst-case analysis of the least-squares method and related identification methods
• Convergence analysis of central and minimax algorithms in scalar regressor models
• On input design in \(\ell_{\infty}\) conditional set membership identification
• On the complexity of piecewise affine system identification

This page was built for publication: On the time complexity of worst-case system identification

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