Sample complexity of worst-case \(H^\infty\)-identification

DOI10.1016/0167-6911(96)80520-2zbMath0913.93014OpenAlexW1996859466MaRDI QIDQ1351438

O. Diekmann

Publication date: 27 February 1997

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

Full work available at URL: https://doi.org/10.1016/0167-6911(96)80520-2

zbMATH Keywords

\(\alpha\)-cover\(H^{\infty}\)-coverFractional coverReal \(\alpha\)-coverSample complexityworst case \(H^\infty\)-identification

Mathematics Subject Classification ID

System identification (93B30) (H^infty)-control (93B36)

Related Items (5)

Convergence analysis of central and minimax algorithms in scalar regressor models ⋮ On input design in \(\ell_{\infty}\) conditional set membership identification ⋮ Robustness in \(H_\infty\) identification ⋮ Complexity of identification of linear systems with rational transfer functions ⋮ \(H_{\infty}\) set membership identification: a survey

Cites Work

• Worst-case identification in \(\ell_ 2\): Linear and nonlinear algorithms
• The sample complexity of worst-case identification of FIR linear systems
• Worst-case control-relevant identification
• Fractional covers for convolution products
• 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

This page was built for publication: Sample complexity of worst-case \(H^\infty\)-identification