Constrained interpolation and smoothing
From MaRDI portal
Publication:1078438
DOI10.1007/BF01893421zbMath0596.41012MaRDI QIDQ1078438
Samuel P. Marin, Philip W. Smith, Larry D. Irvine
Publication date: 1986
Published in: Constructive Approximation (Search for Journal in Brave)
smoothing; Newton's method; noisy data; Jacobi method; Gauss-Seidel methods; constrained interpolation; univariate data; consistent quadratic convergence; iteration techniques; smoothest convex interpolant
41A05: Interpolation in approximation theory
41A29: Approximation with constraints
41A15: Spline approximation
Related Items
HIGH‐ORDER POSITIVE, MONOTONE AND CONVEX MULTIGRID INTERPOLATIONS, Armijo Newton method for convex best interpolation, Interpolation of curve data by blended generalized circles, Monotone interpolation of scattered data in \({\mathbb{R}}^ s\), On almost smooth functions and piecewise smooth functions, A dual algorithm for convex-concave data smoothing by cubic \(C^ 2\)- splines, Application of a wheel-rail contact model to railway dynamics in small radius curved tracks, An algorithm for computing constrained smoothing spline functions, An unconstrained dual program for computing convex \(C^ 1\)-spline approximants, A shape preserving interpolant with tension controls, Interpolation and approximation by monotone cubic splines, On best constrained interpolation, Constrained smoothing of histograms by quadratic splines, A survey on univariate data interpolation and approximation by splines of given shape, Partially finite convex programming. I: Quasi relative interiors and duality theory, Partially finite convex programming. II: Explicit lattice models, Constrained best approximation in Hilbert space. II, Spline smoothing under constraints on derivatives, Convexity-preserving interpolatory subdivision, Infinite-dimensional convex programming with applications to constrained approximation, A general projection framework for constrained smoothing., Differentiability and semismoothness properties of integral functions and their applications, Constrained best approximation in Hilbert space, Best interpolation in a strip. II: Reduction to unconstrained convex optimization, Shape constrained smoothing using smoothing splines, Duality and well-posedness in convex interpolation∗), Smoothing and interpolation in a convex subset of a Hilbert space : II. The semi-norm case, On the Convergence of Moment Problems
Cites Work
