Algorithms for worst case identification in \(\mathcal H_{\infty}\) and in the \(\nu\)-gap metric
DOI10.1016/J.AUTOMATICA.2004.01.019zbMath1110.93004OpenAlexW2061164048MaRDI QIDQ1888418
Publication date: 23 November 2004
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2004.01.019
convergencedistancerobust identificationsmoothnessa priori error boundsidentification for controlidentification algorithm\(\nu\)-gap metricapproximation in \( \mathcal L_2\)-gapwinding number constraintwinding number correction
Sensitivity (robustness) (93B35) System identification (93B30) (H^infty)-control (93B36) Proceedings, conferences, collections, etc. pertaining to systems and control theory (93-06)
Related Items (7)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A class of algorithms for identification in \(\mathcal H_{\infty}\)
- Algorithms for worst case identification in \(\mathcal H_{\infty}\) and in the \(\nu\)-gap metric
- Worst-case control-relevant identification
- Frequency domain uncertainty and the graph topology
- Control oriented system identification: a worst-case/deterministic approach in H/sub infinity /
- Robust identification of strongly stabilizable systems
- A linear matrix inequality approach to H∞ control
- Fast identification n-widths and uncertainty principles for LTI and slowly varying systems
- Modeling of normalized coprime factors with ν-metric uncertainty
- Worst case system identification in H/sub ∞/: validation of a priori information, essentially optimal algorithms, and error bounds
This page was built for publication: Algorithms for worst case identification in \(\mathcal H_{\infty}\) and in the \(\nu\)-gap metric