Orthogonal projections are optimal algorithms
From MaRDI portal
By the use of Housholder transformations it is shown that orthogonal projections onto the range of the adjoint of the information operator are, in a very general sense, optimal algorithms. This allows a unified presentation of worst case optimal algorithms and average case optimal algorithms relative to Gaussian measures on infinite dimensional Hilbert spaces. The choice of optimal information is also discussed.
Recommendations
Cites work
- Average case optimality for linear problems
- Gaussian measures in Banach spaces
- scientific article; zbMATH DE number 3688714 (Why is no real title available?)
- scientific article; zbMATH DE number 3601500 (Why is no real title available?)
- Optimal Estimation of Linear Operators in Hilbert Spaces from Inaccurate Data
- SYMMETRIC GAUGE FUNCTIONS AND UNITARILY INVARIANT NORMS
Cited in
(10)- Average case optimal algorithms in Hilbert spaces
- Oblique projections: Formulas, algorithms, and error bounds
- Random approximation of Sobolev embeddings
- Linear widths of a multivariate function space equipped with a Gaussian measure
- scientific article; zbMATH DE number 4100509 (Why is no real title available?)
- scientific article; zbMATH DE number 177344 (Why is no real title available?)
- Samplets: wavelet concepts for scattered data
- Probabilistic and average widths of multivariate Sobolev spaces with mixed derivative equipped with the Gaussian measure
- s-numbers in information-based complexity
- Orthogonally invariant measures and best approximation of linear operators
This page was built for publication: Orthogonal projections are optimal algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q788227)