On the existence of optimal affine methods for approximating linear functionals

DOI10.1016/0885-064X(86)90009-9zbMath0639.41014MaRDI QIDQ1100370

Aleksei G. Sukharev

Publication date: 1986

Published in: Journal of Complexity (Search for Journal in Brave)

zbMATH Keywords

convex setlinear functionaloptimal affine methods

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50)

Related Items

Quadrature Formulas for Monotone Functions ⋮ Interpolation of Lipschitz functions ⋮ Necessary and sufficient conditions for robust identification of uncertain LTIstems ⋮ Optimal recovery of functionals based on inaccurate data

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of information-based complexity
• Linear problems (with extended range) have linear optimal algorithms
• Best approximation of analytic functions from information about their values at a finite number of points
• Best approximation of functions specified with an error at a finite number of points
• Tractability of quasilinear problems II: Second-order elliptic problems
• On the optimality of linear methods for operator approximation in convex classes of functions