A dual algorithm for convex-concave data smoothing by cubic \(C^ 2\)- splines
From MaRDI portal
Publication:915349
DOI10.1007/BF01386414zbMath0702.65017OpenAlexW1968822835MaRDI QIDQ915349
Publication date: 1990
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/133452
Numerical computation using splines (65D07) Numerical smoothing, curve fitting (65D10) Convex programming (90C25) Spline approximation (41A15)
Related Items (10)
Shape preserving least-squares approximation by polynomial parametric spline curves ⋮ Shape-preserving interpolation on surfaces via variable-degree splines ⋮ Shape preserving approximation by spatial cubic splines ⋮ A general projection framework for constrained smoothing. ⋮ Constrained smoothing of histograms by quadratic splines ⋮ Constrained approximation by splines with free knots ⋮ Unconstrained duals to partially separable constrained programs ⋮ Shape constrained smoothing using smoothing splines ⋮ Semiparametric regression with shape-constrained penalized splines ⋮ Spline smoothing under constraints on derivatives
Cites Work
- Unnamed Item
- Algorithms for computing shape-preserving spline approximations to data
- Convex spline interpolants with minimal curvature
- Constrained interpolation and smoothing
- An algorithm for computing constrained smoothing spline functions
- On tridiagonal linear complementarity problems
- An unconstrained dual program for computing convex \(C^ 1\)-spline approximants
- Positivity of cubic polynomials on intervals and positive spline interpolation
- Determination of shape preserving spline interpolants with minimal curvature via dual programs
- Unconstrained duals to partially separable constrained programs
- A practical guide to splines
- Smoothing by spline functions.
- SPLINE FUNCTIONS AND THE PROBLEM OF GRADUATION
- Convex Analysis
This page was built for publication: A dual algorithm for convex-concave data smoothing by cubic \(C^ 2\)- splines
