An optimal adaptive algorithm for the approximation of concave functions
From MaRDI portal
Recommendations
- Approximation in p-norm of univariate concave functions
- An algorithm for approximating piecewise linear concave functions from sample gradients
- scientific article; zbMATH DE number 3879983
- Sandwich approximation of univariate convex functions with an application to separable convex programming
- scientific article; zbMATH DE number 4130198
Cites work
- scientific article; zbMATH DE number 3174053 (Why is no real title available?)
- scientific article; zbMATH DE number 3879983 (Why is no real title available?)
- scientific article; zbMATH DE number 524184 (Why is no real title available?)
- scientific article; zbMATH DE number 1059230 (Why is no real title available?)
- A method for convex curve approximation
- Approximation of convex curves with application to the bicriterial minimum cost flow problem
- Minimax models in the theory of numerical methods. Transl. from the 1989 Russian orig. by Olga Chuyan
- Sandwich approximation of univariate convex functions with an application to separable convex programming
- The convergence rate of the sandwich algorithm for approximating convex functions
Cited in
(6)- Nonlinear function approximation: computing smooth solutions with an adaptive greedy algorithm
- Approximation in p-norm of univariate concave functions
- A new algorithm for approximating the least concave majorant.
- An algorithm for approximating piecewise linear concave functions from sample gradients
- Robust density estimation with the \(\mathbb{L}_1\)-loss. Applications to the estimation of a density on the line satisfying a shape constraint
- The adaptive algorithm for minimizing the sum of absolute values of linear functions
This page was built for publication: An optimal adaptive algorithm for the approximation of concave functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2492698)
