Approximation in p-norm of univariate concave functions
From MaRDI portal
Publication:2247899
Recommendations
- An optimal adaptive algorithm for the approximation of concave functions
- scientific article; zbMATH DE number 3956307
- A method for approximating univariate convex functions using only function value evaluations
- The convergence rate of the sandwich algorithm for approximating convex functions
- Uniform tree approximation by global optimization techniques
Cites work
- An optimal adaptive algorithm for the approximation of concave functions
- An optimal sequential algorithm for the uniform approximation of convex functions on \([0,1]^ 2\)
- scientific article; zbMATH DE number 3879983 (Why is no real title available?)
- scientific article; zbMATH DE number 3688714 (Why is no real title available?)
- Sandwich approximation of univariate convex functions with an application to separable convex programming
- The concept of sequential optimality for problems in numerical analysis
- The convergence rate of the sandwich algorithm for approximating convex functions
Cited in
(4)- Approximating convex functions via non-convex oracles under the relative noise model
- An optimal adaptive algorithm for the approximation of concave functions
- A bounded p-norm approximation of MAX-convolution for sub-quadratic Bayesian inference on additive factors
- Nikolskii-type estimates for coconvex approximation of functions with one inflection point
This page was built for publication: Approximation in p-norm of univariate concave functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2247899)
