Worst-case errors of linear algorithms for identification in H
From MaRDI portal
Publication:4259101
DOI10.1080/002071798222884zbMATH Open0930.93020OpenAlexW2073549587WikidataQ56319481 ScholiaQ56319481MaRDI QIDQ4259101FDOQ4259101
Authors: Jonathan R. Partington
Publication date: 22 August 1999
Published in: International Journal of Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/002071798222884
Recommendations
Cited In (14)
- Worst-case identification in \(\ell_ 2\): Linear and nonlinear algorithms
- Optimal worst case estimation for LPV--FIR models with bounded errors
- The sample complexity of worst-case identification of FIR linear systems
- Algorithms for worst case identification in \(\mathcal H_{\infty}\) and in the \(\nu\)-gap metric
- Title not available (Why is that?)
- Title not available (Why is that?)
- A generalization of a standard inequality for Hardy space \(H_1\)
- A stochastic analysis of robust estimation algorithms inH∞with rational basis functions
- Comments on "Least squares methods for H/spl infin/ control oriented system identification"
- \(L_\infty\) parameter identification based on linear programming recursive algorithm
- Linear and nonlinear algorithms for identification in H/sub infinity / with error bounds
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal asymptotic identification under bounded disturbances
This page was built for publication: Worst-case errors of linear algorithms for identification in H
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4259101)