Convex spline interpolants with minimal curvature
From MaRDI portal
Publication:1058257
DOI10.1007/BF02260507zbMath0564.65005OpenAlexW134033654MaRDI QIDQ1058257
Jochen W. Schmidt, Wolfgang Burmeister, Walter Heß
Publication date: 1985
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02260507
quadratic programmingNewton's methodconvex spline interpolantsdual optimization problemminimal mean curvaturetridiagonal Hessian
Numerical computation using splines (65D07) Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Spline approximation (41A15)
Related Items
Quadratic and related exponential splines in shape preserving interpolation, 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, Regularity and well-posedness of a dual program for convex best \(C^{1}\)-spline interpolation, Shape preserving histopolation using rational quadratic splines, A Newton-type method for positive-semidefinite linear complementarity problems, Determination of shape preserving spline interpolants with minimal curvature via dual programs, A decomposition-dualization approach for solving constrained convex minimization problems with applications to discretized obstacle problems, On the choice of the initial value of a quadratic spline in positive interpolation, Positive interpolation with rational quadratic splines, Constructive methods in convex \(C^ 2\) interpolation using quartic splines, A dual algorithm for convex-concave data smoothing by cubic \(C^ 2\)- splines, Unnamed Item, Constrained smoothing of histograms by quadratic splines, \(C^2\) rational quartic/cubic spline interpolant with shape constraints, Unconstrained duals to partially separable constrained programs, A survey on univariate data interpolation and approximation by splines of given shape, Convex interval interpolation with cubic splines, Optimizing at the end-points the Akima's interpolation method of smooth curve fitting, Convex interval interpolation with cubic splines. II, A local algorithm for constructing non-negative cubic splines, Shape-preserving, multiscale interpolation by univariate curvature-based cubic \(L_{1}\) splines in Cartesian and polar coordinates, Convexity preserving interpolation with exponential splines
Cites Work
- Unnamed Item
- Unnamed Item
- Schwach verkoppelte Ungleichungssysteme und konvexe Spline-Interpolation
- Determination of shape preserving spline interpolants with minimal curvature via dual programs
- On the solution of large, structured linear complementarity problems: The tridiagonal case
- Uniform approximation by some Hermite interpolating splines
- Spezielle rationale Splinefunktionen
- Monotone and Convex Spline Interpolation
- Convex cubic Hermite-spline interpolation
