Convex spline interpolants with minimal curvature
type: Item
instance of: scholarly article
title: Convex spline interpolants with minimal curvature
zbMATH Open document ID: 0564.65005
DOI: 10.1007/BF02260507
author: Wolfgang Burmeister
author: Jochen W. Schmidt
author: Walter Heß
published in: Computing
publication date: 1985-01-01T00:00:00Z
review text: The problem of finding convex spline interpolants with minimal mean curvature leads to a quadratic optimization problem of special structure. In the present note a corresponding dual problem without constraints is derived. Its objective function is piecewise quadratic and therefore admits an effective numerical treatment.
Mathematics Subject Classification ID: 65D07
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 41A15
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 3900028
zbMATH Keywords: quadratic programming
zbMATH Keywords: dual optimization problem
zbMATH Keywords: tridiagonal Hessian
zbMATH Keywords: Newton's method
zbMATH Keywords: convex spline interpolants
zbMATH Keywords: minimal mean curvature
MaRDI profile type: Publication
cites work: On the solution of large, structured linear complementarity problems: The tridiagonal case
cites work: Determination of shape preserving spline interpolants with minimal curvature via dual programs
cites work: Q3928936
cites work: Q3049739
cites work: Convex cubic Hermite-spline interpolation
cites work: Uniform approximation by some Hermite interpolating splines
cites work: Monotone and Convex Spline Interpolation
cites work: Spezielle rationale Splinefunktionen
cites work: Schwach verkoppelte Ungleichungssysteme und konvexe Spline-Interpolation
full work available at URL: https://doi.org/10.1007/bf02260507
OpenAlex ID: W134033654
description: scientific article; zbMATH DE number 3900028