Constrained interpolation and smoothing

DOI10.1007/BF01893421zbMath0596.41012MaRDI QIDQ1078438

Samuel P. Marin, Larry D. Irvine, Philip W. Smith

Publication date: 1986

Published in: Constructive Approximation (Search for Journal in Brave)

zbMATH Keywords

smoothingNewton's methodnoisy dataJacobi methodGauss-Seidel methodsconstrained interpolationunivariate dataconsistent quadratic convergenceiteration techniquessmoothest convex interpolant

Mathematics Subject Classification ID

Interpolation in approximation theory (41A05) Approximation with constraints (41A29) Spline approximation (41A15)

Related Items (33)

HIGH‐ORDER POSITIVE, MONOTONE AND CONVEX MULTIGRID INTERPOLATIONS ⋮ Smooth and Semismooth Newton Methods for Constrained Approximation and Estimation ⋮ An algorithm for computing constrained smoothing spline functions ⋮ Smoothing and interpolation in a convex subset of a Hilbert space : II. The semi-norm case ⋮ An unconstrained dual program for computing convex \(C^ 1\)-spline approximants ⋮ A shape preserving interpolant with tension controls ⋮ Best interpolation in a strip. II: Reduction to unconstrained convex optimization ⋮ On almost smooth functions and piecewise smooth functions ⋮ Constrained data smoothing via optimal control ⋮ 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 ⋮ A general projection framework for constrained smoothing. ⋮ Interpolation and approximation by monotone cubic splines ⋮ Duality and well-posedness in convex interpolation^∗) ⋮ On best constrained interpolation ⋮ Interpolation of curve data by blended generalized circles ⋮ On the Convergence of Moment Problems ⋮ 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 ⋮ Shape constrained smoothing using smoothing splines ⋮ Semiparametric regression with shape-constrained penalized splines ⋮ Differentiability and semismoothness properties of integral functions and their applications ⋮ Monotone interpolation of scattered data in \({\mathbb{R}}^ s\) ⋮ Armijo Newton method for convex best interpolation ⋮ Constrained best approximation in Hilbert space ⋮ Shape-preserving interpolation and smoothing for options market implied volatility ⋮ Computing the Best Approximation over the Intersection of a Polyhedral Set and the Doubly Nonnegative Cone ⋮ Spline smoothing under constraints on derivatives ⋮ Convexity-preserving interpolatory subdivision ⋮ Infinite-dimensional convex programming with applications to constrained approximation

Cites Work

• Unnamed Item
• Unnamed Item
• Constrained \(L_ p\) approximation
• A practical guide to splines
• On \(M\)-functions and their application to nonlinear Gauss-Seidel iterations and to network flows
• Jacobi and Gauss–Seidel Methods for Nonlinear Network Problems

This page was built for publication: Constrained interpolation and smoothing