On input design in _ conditional set membership identification
From MaRDI portal
Publication:875987
DOI10.1016/J.AUTOMATICA.2006.01.006zbMATH Open1137.93317OpenAlexW47200677MaRDI QIDQ875987FDOQ875987
Authors: Marco Casini, Andrea Garulli, Antonio Vicino 
Publication date: 16 April 2007
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2006.01.006
Recommendations
- Optimality, approximation, and complexity in set membership H/sub ∞/ identification
- Error bounds for conditional algorithms in restricted complexity set membership identification
- Optimal and suboptimal algorithms in set membership identification
- Asymptotic properties of set membership identification algorithms
- Membership set estimators: size, optimal inputs, complexity and relations with least squares
- \(H_{\infty}\) set membership identification: a survey
- Conditional central algorithms for worst case set-membership identification and filtering
- A Unified Framework for Solving a General Class of Conditional and Robust Set-Membership Estimation Problems
- scientific article; zbMATH DE number 2092126
- Tight error bounds for projection algorithms in conditional set membership estimation
Cites Work
- Conditionally optimal algorithms and estimation of reduced order models
- Conditional central algorithms for worst case set-membership identification and filtering
- System identification using Laguerre models
- Optimal estimation theory for dynamic systems with set membership uncertainty: An overview
- System identification using Kautz models
- Fast identification n-widths and uncertainty principles for LTI and slowly varying systems
- Optimal asymptotic identification under bounded disturbances
- System identification with generalized orthonormal basis functions
- Robust identification and Galois sequences
- On the time complexity of worst-case system identification
- Model quality evaluation in set membership identification
- Complexity of identification of linear systems with rational transfer functions
- Sample complexity of worst-case \(H^\infty\)-identification
- Optimality properties in finite sample li identification with bounded noise
- Worst-case conditional system identification in a general class of norms
- Error bounds for conditional algorithms in restricted complexity set membership identification
- On system identification of complex systems from finite data
Cited In (7)
- Error bounds for conditional algorithms in restricted complexity set membership identification
- Variance error, interpolation and experiment design
- Input design in worst-case system identification with quantized measurements
- Informative input design for kernel-based system identification
- Efficient computation of \(\ell _1\) uncertainty model from an impulse response set
- Title not available (Why is that?)
- On the optimal worst-case experiment design for constrained linear systems
This page was built for publication: On input design in \(\ell_{\infty}\) conditional set membership identification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q875987)
