Conditionally optimal algorithms and estimation of reduced order models
From MaRDI portal
Publication:1112002
DOI10.1016/0885-064X(88)90009-XzbMath0658.93074MaRDI QIDQ1112002
Antonio Vicino, Mario Milanese, Bolesław Kacewicz
Publication date: 1988
Published in: Journal of Complexity (Search for Journal in Brave)
system identification; complexity theory; conditional central algorithms; conditional projection algorithm; conditional worst case error; reduced order model estimation; restricted algorithms
68Q25: Analysis of algorithms and problem complexity
93E10: Estimation and detection in stochastic control theory
93E12: Identification in stochastic control theory
94A15: Information theory (general)
Related Items
Optimal and suboptimal algorithms in set membership identification, Optimal conditional estimation: Average case setting, On the optimal robust solution of IVPs with noisy information, On input design in \(\ell_{\infty}\) conditional set membership identification, Optimal estimation theory for dynamic systems with set membership uncertainty: An overview, Reliability of projection algorithms in conditional estimation, Model quality evaluation in set membership identification, Tight error bounds for projection algorithms in conditional set membership estimation, Optimal approximation of stochastic integrals in analytic noise model, Randomized Runge-Kutta method -- stability and convergence under inexact information, One-shot set-membership identification of generalized Hammerstein-Wiener systems, Randomized derivative-free Milstein algorithm for efficient approximation of solutions of SDEs under noisy information, Optimal pointwise approximation of SDE's from inexact information, Worst-case input-output identification
Cites Work
