Optimal and suboptimal algorithms in set membership identification
From MaRDI portal
Publication:5712060
DOI10.1080/13873950500068575zbMath1122.93023OpenAlexW2027184413MaRDI QIDQ5712060
Publication date: 22 December 2005
Published in: Mathematical and Computer Modelling of Dynamical Systems (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10.1080/13873950500068575
Cites Work
- Conditionally optimal algorithms and estimation of reduced order models
- Worst case system identification in \(\ell{}_ 1\): Optimal algorithms and error bounds
- Reliability of projection algorithms in conditional estimation
- On robustness in system identification
- Information-based complexity and nonparamteric worst-case system identification
- Weighted average errors in set-membership estimation
- Optimal average case estimation in Hilbert norms
- Control oriented system identification: a worst-case/deterministic approach in H/sub infinity /
This page was built for publication: Optimal and suboptimal algorithms in set membership identification