Do Linear Problems Have Linear Optimal Algorithms?
DOI10.1137/1030091zbMATH Open0732.41035OpenAlexW2068169430MaRDI QIDQ3357652FDOQ3357652
Authors: Edward W. Packel 
Publication date: 1988
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1030091
Recommendations
Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Approximation by arbitrary linear expressions (41A45) Normed linear spaces and Banach spaces; Banach lattices (46B99) Numerical solutions to equations with linear operators (65J10)
Cited In (14)
- Linearity of algorithms and a result of Ando
- Mini-minimax uncertainty quantification for emulators
- The algorithm designer versus nature: A game-theoretic approach to information-based complexity
- 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
- Title not available (Why is that?)
- Learning from non-random data in Hilbert spaces: an optimal recovery perspective
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- 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)
