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

DOI10.1109/TAC.2002.803535zbMATH Open1364.93165MaRDI QIDQ5267049FDOQ5267049

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)

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

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)