An optimal sequential algorithm for the uniform approximation of convex functions on \([0,1]^ 2\)
From MaRDI portal
Publication:595316
DOI10.1007/BF01448382zbMath0527.65010MaRDI QIDQ595316
Publication date: 1983
Published in: Applied Mathematics and Optimization (Search for Journal in Brave)
error estimates; lower bounds; global error; sequential selection of nodes for uniform approximation of convex functions
41A63: Multidimensional problems
41A25: Rate of convergence, degree of approximation
65D15: Algorithms for approximation of functions
41A30: Approximation by other special function classes
Related Items
Sequential algorithms of optimal order global error for the uniform recovery of functions with monotone (r-1) derivatives, The convergence rate of the sandwich algorithm for approximating convex functions, Approximation of convex sets by polytopes, Sandwich approximation of univariate convex functions with an application to separable convex programming
Cites Work