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.











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)