Optimal sequential and non-sequential procedures for evaluating a functional

DOI10.1080/00036818008839292zbMath0445.65010OpenAlexW2086659717WikidataQ58256427 ScholiaQ58256427MaRDI QIDQ3889994

Shmuel Gal, Charles A. Micchelli

Publication date: 1980

Published in: Applicable Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00036818008839292

zbMATH Keywords

randomrate of convergencedeterministicconvex functionalsequentialfunction evaluationsoptimal procedureestimation problemssequential evaluation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Sequential statistical methods (62L99) Numerical optimization and variational techniques (65K10) Algorithms for approximation of functions (65D15)

Related Items

A survey of information-based complexity, Testing linear operators, On adaption with noisy information, The adaption problem for approximating linear operators, Randomized complexity of parametric integration and the role of adaption. I: Finite dimensional case, Recent developments in information-based complexity, Complexity of linear problems with a fixed output basis, Generalized adaptive versus nonadaptive recovery from noisy information, The power of adaption for approximating functions with singularities, Adaption helps for some nonconvex classes, Optimal approximation of elliptic problems by linear and nonlinear mappings. II, On the adaptive and continuous information problems, On adaptive information with varying cardinality for linear problems with elliptically contoured measures, On adaptive and non-adaptive stochastic and deterministic algorithms, Can adaption help on the average?, Information of varying cardinality, Optimal solution of nonlinear equations satisfying a Lipschitz condition, Adaption allows efficient integration of functions with unknown singularities, On piecewise-polynomial approximation of functions with a bounded fractional derivative in an \(L_ p\)-norm

Cites Work

• Unnamed Item
• Optimum Sequential Search and Approximation Methods Under Minimum Regularity Assumptions
• On the optimality of linear methods for operator approximation in convex classes of functions
• Minimax Theorems