Conditionally optimal algorithms and estimation of reduced order models
The paper presents optimality results for algorithms used in the field of system identification in the light of the information-based complexity theory. A class of restricted algorithms is defined by means of a restriction in the space of solution elements, and a corresponding conditional worst case error is introduced. We define conditional central algorithms and show their optimality. A conditional central algorithm is then constructed by modifying a projection algorithm and obtaining in this way a conditional projection algorithm. This algorithm is shown to enjoy local optimality properties with respect to the problem element space within the class of conditionally correct algorithms. Finally, it is shown how the obtained results can be used to handle the problem of reduced order model estimation.
- Optimal conditional estimation: Average case setting
- Error bounds for conditional algorithms in restricted complexity set membership identification
- Optimality of central and projection algorithms for bounded uncertainty
- Optimal and suboptimal algorithms in set membership identification
- Worst-case conditional system identification in a general class of norms
- A note on the derivation and use of reduced-order models
- Global approximation of a compact set by elements of a convex set in a normed space
- scientific article; zbMATH DE number 3827201 (Why is no real title available?)
- scientific article; zbMATH DE number 3688714 (Why is no real title available?)
- Optimal algorithms theory for robust estimation and prediction
- Optimality of central and projection algorithms for bounded uncertainty
- 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
- On the optimal robust solution of IVPs with noisy information
- scientific article; zbMATH DE number 4158458 (Why is no real title available?)
- Worst-case input-output identification
- Greedy Algorithms for Optimal Measurements Selection in State Estimation Using Reduced Models
- Optimal and suboptimal algorithms in set membership identification
- Optimal conditional estimation: Average case setting
- Reduced-order identification methods: hierarchical algorithm or variable elimination algorithm
- On input design in \(\ell_{\infty}\) conditional set membership identification
This page was built for publication: Conditionally optimal algorithms and estimation of reduced order models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1112002)
