An optimal adaptive algorithm for the approximation of concave functions
From MaRDI portal
Publication:2492698
DOI10.1007/s10107-003-0502-7zbMath1132.90018MaRDI QIDQ2492698
Publication date: 14 June 2006
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-003-0502-7
90C39: Dynamic programming
41A29: Approximation with constraints
65D15: Algorithms for approximation of functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The convergence rate of the sandwich algorithm for approximating convex functions
- A method for convex curve approximation
- Minimax models in the theory of numerical methods. Transl. from the 1989 Russian orig. by Olga Chuyan
- Approximation of convex curves with application to the bicriterial minimum cost flow problem
- Sandwich approximation of univariate convex functions with an application to separable convex programming