Optimality, approximation, and complexity in set membership H/sub ∞/ identification

DOI10.1109/TAC.2002.803535MaRDI QIDQ5267049zbMATH OpenFDO

Authors Mario Milanese, Michele Taragna

Publication date 20 June 2017

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

Mathematics Subject Classification ID

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

Cited in

(10)

• Direct data-driven filter design for uncertain LTI systems with bounded noise
• Relations between uncertainty structures in identification for robust control
• On input design in \(\ell_{\infty}\) conditional set membership identification
• From experiment design to closed-loop control
• Asymptotic properties of set membership identification algorithms
• Non-asymptotic quality assessment of generalised FIR models with periodic inputs
• Set-membership identification and fault detection using a Bayesian framework
• Computational complexity analysis of set membership identification of Hammerstein and Wiener systems
• \(H_{\infty}\) set membership identification: a survey
• Error bounds for conditional algorithms in restricted complexity set membership identification

This page was built for publication: Optimality, approximation, and complexity in set membership H/sub ∞/ identification

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