Abstract We present bounds on the maximal gain of adaptive and randomized algorithms over nonadaptive, deterministic ones for approximating linear operators on convex sets. If the sets are additionally symmetric, then our results are optimal. For nonsymmetric sets, we unify some notions of n -widths and s-numbers, and show their connection to minimal errors. We also discuss extensions to nonlinear widths and approximation based on function values, and conclude with a list of open problems.
Building similarity graph...
Analyzing shared references across papers
Loading...
David Krieg
Erich Novak
Mario Ullrich
Forum of Mathematics Sigma
Friedrich Schiller University Jena
Johannes Kepler University of Linz
University of Passau
Building similarity graph...
Analyzing shared references across papers
Loading...
Krieg et al. (Wed,) studied this question.
www.synapsesocial.com/papers/68d46aa631b076d99fa67651 — DOI: https://doi.org/10.1017/fms.2025.10101