A dual algorithm for convex-concave data smoothing by cubic \(C^ 2\)- splines
type: Item
instance of: scholarly article
title: A dual algorithm for convex-concave data smoothing by cubic \(C^ 2\)- splines
zbMATH Open document ID: 0702.65017
DOI: 10.1007/BF01386414
author: Jochen W. Schmidt
author: Isa Scholz
published in: Numerische Mathematik
publication date: 1990-01-01T00:00:00Z
full work available at URL: https://eudml.org/doc/133452
review text: The problem of smoothing a given data set by a cubic \(C^ 2\)-spline is discussed. The spline may require to be convex in some parts of the domain and concave in other parts. The special structure of the arising finite dimensional convex program allows a dualization such that the resulting concave dual program is unconstrained. The latter program is treated numerically much more easier than the original program. In this paper the details for applying the strategy to the present smoothing problem are elaborated. Also some numerical tests are presented.
Mathematics Subject Classification ID: 65D10
Mathematics Subject Classification ID: 65D07
Mathematics Subject Classification ID: 41A15
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 4151705
zbMATH Keywords: dual algorithm of program
zbMATH Keywords: convex-concave data smoothing
zbMATH Keywords: cubic spline
zbMATH Keywords: numerical tests
reviewed by: Shuguang Wang
MaRDI profile type: Publication
cites work: Convex spline interpolants with minimal curvature
cites work: A practical guide to splines
cites work: Determination of shape preserving spline interpolants with minimal curvature via dual programs
cites work: Unconstrained duals to partially separable constrained programs
cites work: Algorithms for computing shape-preserving spline approximations to data
cites work: An algorithm for computing constrained smoothing spline functions
cites work: Q4171860
cites work: Constrained interpolation and smoothing
cites work: Smoothing by spline functions.
cites work: Convex Analysis
cites work: On tridiagonal linear complementarity problems
cites work: An unconstrained dual program for computing convex \(C^ 1\)-spline approximants
cites work: Positivity of cubic polynomials on intervals and positive spline interpolation
cites work: SPLINE FUNCTIONS AND THE PROBLEM OF GRADUATION
OpenAlex ID: W1968822835
description: scientific article; zbMATH DE number 4151705