An unconstrained dual program for computing convex \(C^ 1\)-spline approximants
From MaRDI portal
Publication:1096312
DOI10.1007/BF02310102zbMath0633.65008OpenAlexW367892792MaRDI QIDQ1096312
Publication date: 1987
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02310102
Numerical computation using splines (65D07) Numerical smoothing, curve fitting (65D10) Spline approximation (41A15)
Related Items (8)
Regularity and well-posedness of a dual program for convex best \(C^{1}\)-spline interpolation ⋮ A dual algorithm for convex-concave data smoothing by cubic \(C^ 2\)- splines ⋮ A general projection framework for constrained smoothing. ⋮ Constrained smoothing of histograms by quadratic splines ⋮ Unconstrained duals to partially separable constrained programs ⋮ A survey on univariate data interpolation and approximation by splines of given shape ⋮ Shape constrained smoothing using smoothing splines ⋮ Convex interval interpolation with cubic splines. II
Cites Work
- Unnamed Item
- Convex interval interpolation with cubic splines
- Algorithms for computing shape-preserving spline approximations to data
- Convex spline interpolants with minimal curvature
- Constrained interpolation and smoothing
- Quadratic and related exponential splines in shape preserving interpolation
- On tridiagonal linear complementarity problems
- A decomposition-dualization approach for solving constrained convex minimization problems with applications to discretized obstacle problems
- Uniform approximation by some Hermite interpolating splines
- A practical guide to splines
- Smoothing by spline functions.
- Monotone and Convex Approximation by Splines: Error Estimates and a Curve Fitting Algorithm
- SPLINE FUNCTIONS AND THE PROBLEM OF GRADUATION
- Convex Analysis
This page was built for publication: An unconstrained dual program for computing convex \(C^ 1\)-spline approximants
