Information-based complexity and nonparamteric worst-case system identification

DOI10.1006/jcom.1993.1028zbMath0806.93013MaRDI QIDQ1330145

Mario Milanese, Antonio Vicino

Publication date: 17 August 1994

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcom.1993.1028

zbMATH Keywords

almost-optimal algorithms; information-based complexity theory

Mathematics Subject Classification ID

93B30: System identification

68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)

Related Items

Optimality properties in finite sample l_i identification with bounded noise, Efficient numerical approximation of maximum entropy estimates, Optimal and suboptimal algorithms in set membership identification, Robustness in \(H_\infty\) identification, Optimal conditional estimation: Average case setting, LTI modelling of NFIR systems: near-linearity and control, LS estimation and linearization, On robustness in control and LTI identification: near-linearity and non-conic uncertainty, \(L^\infty\) system approximation algorithms generated by \(\varphi\) summations, Predictive self-tuning control by parameter bounding and worst-case design, Complexity of identification of linear systems with rational transfer functions, Model quality evaluation in set membership identification, Squared and absolute errors in optimal approximation of nonlinear systems., Input-output identifiability of continuous-time linear systems, Properties of least squares estimates in set membership identification, Estimation of model quality, Worst-case control-relevant identification, Modelling of uncertain systems via linear programming, \(H_{\infty}\) identification of ``soft uncertainty models, Unnamed Item, On the sample-complexity of ?? identification, Unnamed Item