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 identificationcomplexity theoryconditional central algorithmsconditional projection algorithmconditional worst case errorreduced order model estimationrestricted algorithms
Analysis of algorithms and problem complexity (68Q25) Estimation and detection in stochastic control theory (93E10) Identification in stochastic control theory (93E12) Information theory (general) (94A15)
Related Items
Optimal pointwise approximation of SDE's from inexact information, Model quality evaluation in set membership identification, On input design in \(\ell_{\infty}\) conditional set membership identification, Worst-case input-output identification, 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, Tight error bounds for projection algorithms in conditional set membership estimation, Optimal estimation theory for dynamic systems with set membership uncertainty: An overview, Optimal and suboptimal algorithms in set membership identification, Optimal approximation of stochastic integrals in analytic noise model, Optimal conditional estimation: Average case setting, Randomized Runge-Kutta method -- stability and convergence under inexact information, Reliability of projection algorithms in conditional estimation, On the optimal robust solution of IVPs with noisy information
Cites Work
