On the time complexity of worst-case system identification

From MaRDI portal
Publication:4307411

DOI10.1109/9.284870zbMath0813.93068OpenAlexW2150566466MaRDI QIDQ4307411

Ashok Tikku, Kameshwar R. 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




Related Items (22)

Convergence analysis of central and minimax algorithms in scalar regressor modelsClosed-loop persistent identification of linear systems with unmodeled dynamics and stochastic disturbancesWorst-case identification of nonlinear fading memory systemsAnalysis of linear methods for robust identification in \(\ell_ 1\)Sample complexity of worst-case \(H^\infty\)-identificationEstimation of model qualityWorst-case control-relevant identificationModelling of uncertain systems via linear programmingOn input design in \(\ell_{\infty}\) conditional set membership identificationFractional covers for convolution productsOn the worst-case divergence of the least-squares algorithmUncertainty, information and complexity in identification and controlInput design in worst-case system identification with quantized measurementsOn the sample-complexity of ?? identificationWorst-case analysis of the least-squares method and related identification methodsRobust noise attenuation under stochastic noises and worst-case unmodelled dynamicsNecessary and sufficient conditions for robust identification of uncertain LTIstemsSpace and time complexities and sensor threshold selection in quantized identificationIdentification and adaptive control: Towards a complexity-based general theoryComplexity of identification of linear systems with rational transfer functionsOn the optimal worst-case experiment design for constrained linear systemsWorst-case identification in \(\ell_ 2\): Linear and nonlinear algorithms




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