Do Linear Problems Have Linear Optimal Algorithms?
From MaRDI portal
Publication:3357652
Recommendations
Cited in
(14)- Linearity of algorithms and a result of Ando
- The algorithm designer versus nature: A game-theoretic approach to information-based complexity
- Mini-minimax uncertainty quantification for emulators
- Recent developments in information-based complexity
- Are linear algorithms always good for linear problems?
- There exists a linear problem with infinite combinatory complexity
- Full recovery from point values: an optimal algorithm for Chebyshev approximability prior
- scientific article; zbMATH DE number 822135 (Why is no real title available?)
- Learning from non-random data in Hilbert spaces: an optimal recovery perspective
- scientific article; zbMATH DE number 139625 (Why is no real title available?)
- Can linear superiorization be useful for linear optimization problems?
- Radius of information for two intersected centered hyperellipsoids and implications in optimal recovery from inaccurate data
- scientific article; zbMATH DE number 446839 (Why is no real title available?)
- Optimal residual algorithms for linear operator equations
This page was built for publication: Do Linear Problems Have Linear Optimal Algorithms?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3357652)