The Caratheodory-Fejer problem and H/sub ∞//l/sub 1/ identification: a time domain approach

DOI10.1109/9.376099zbMath0827.93019MaRDI QIDQ4841531

Jie Chen, Carl N. Nett

Publication date: 9 October 1995

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/9.376099

zbMATH Keywords

identification; robust control; convex programming; worst-case; Carathéodory-Fejér problem; \({\mathcal H}_ \infty\) identification; \(\ell_ 1\) identification; interpolatory algorithms

Mathematics Subject Classification ID

90C25: Convex programming

93B35: Sensitivity (robustness)

93B30: System identification

93B36: (H^infty)-control

Related Items

\(L^\infty\) system approximation algorithms generated by \(\varphi\) summations, Algorithms for robust identification in \({\mathcal H}_\infty\) with nonuniformly spaced frequency response data, Robust identification for rational fractional transfer functions, Recursive system identification in the presence of noise and model uncertainties, Input-output identifiability of continuous-time linear systems, Open-loop worst-case identification of non-Schur plants., Worst-case control-relevant identification, \(H_{\infty}\) set membership identification: a survey