An algorithm for approximating convex functions by means by first degree splines
From MaRDI portal
Publication:5632019
DOI10.1093/COMJNL/14.3.272zbMath0225.65016OpenAlexW2137436165MaRDI QIDQ5632019
Publication date: 1971
Published in: The Computer Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/comjnl/14.3.272
Related Items (9)
Unnamed Item ⋮ Optimizing resource speed for two-stage real-time tasks ⋮ Optimal objective function approximation for separable convex quadratic programming ⋮ Approximation of quadratic Bézier curves by arc splines ⋮ Sandwich approximation of univariate convex functions with an application to separable convex programming ⋮ An optimization method to solve a fully intuitionistic fuzzy non-linear separable programming problem ⋮ \(L_1\) approximations of strictly convex functions by means of first degree splines ⋮ Integrating unimodality into distributionally robust optimal power flow ⋮ Functional approximation of planar curves via adaptive segmentation
This page was built for publication: An algorithm for approximating convex functions by means by first degree splines