An optimal sequential algorithm for the uniform approximation of convex functions on \([0,1]^ 2\)

DOI10.1007/BF01448382zbMath0527.65010MaRDI QIDQ595316

Gy. Sonnevend

Publication date: 1983

Published in: Applied Mathematics and Optimization (Search for Journal in Brave)

zbMATH Keywords

error estimateslower boundsglobal errorsequential selection of nodes for uniform approximation of convex functions

Mathematics Subject Classification ID

Multidimensional problems (41A63) Rate of convergence, degree of approximation (41A25) Algorithms for approximation of functions (65D15) Approximation by other special function classes (41A30)

Related Items

Sandwich approximation of univariate convex functions with an application to separable convex programming, The convergence rate of the sandwich algorithm for approximating convex functions, Approximation in p-norm of univariate concave functions, Approximation of convex sets by polytopes, Sequential algorithms of optimal order global error for the uniform recovery of functions with monotone (r-1) derivatives

Cites Work

• Zur optimalen Approximation konvexer Hyperflächen durch Polyeder
• An adaptive algorithm for multivariate approximation giving optimal convergence rates
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item