Smoothing and Interpolation in a Convex Subset of a Hilbert Space

DOI10.1137/0909048zbMath0651.65046OpenAlexW2061872779MaRDI QIDQ3796649

Florencio I. Utreras, Charles A. Micchelli

Publication date: 1988

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0909048

zbMATH Keywords

smoothingHilbert spacefittingconvex constraintsleast norm solutiondual extremal problembest interpolationconvex optimal spline interpolationEXAFS spectroscopypositive thin plate splines

Mathematics Subject Classification ID

Numerical computation using splines (65D07) Numerical smoothing, curve fitting (65D10) General theory of numerical analysis in abstract spaces (65J05) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Spline approximation (41A15)

Related Items (36)

Smooth and Semismooth Newton Methods for Constrained Approximation and Estimation ⋮ Generalization of the Kimeldorf-Wahba correspondence for constrained interpolation ⋮ Smoothing and interpolation in a convex subset of a Hilbert space : II. The semi-norm case ⋮ Best interpolation in seminorm with convex constraints ⋮ NON-STRICTLY CONVEX MINIMIZATION OVER THE FIXED POINT SET OF AN ASYMPTOTICALLY SHRINKING NONEXPANSIVE MAPPING ⋮ Curves from variational principles ⋮ Best approximation and perturbation property in Hilbert spaces ⋮ A dual approach to constrained interpolation from a convex subset of Hilbert space ⋮ Gaussian process emulators for computer experiments with inequality constraints ⋮ A new method for interpolating in a convex subset of a Hilbert space ⋮ Best interpolation in a strip. II: Reduction to unconstrained convex optimization ⋮ Interpolation and approximation from convex sets ⋮ Piecewise convex function estimation: Pilot estimators ⋮ Shape preserving least-squares approximation by polynomial parametric spline curves ⋮ Iteration methods for convexly constrained ill-posed problems in hilbert space ⋮ 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 ⋮ Constrained approximation by splines with free knots ⋮ A survey on univariate data interpolation and approximation by splines of given shape ⋮ Constrained best approximation in Hilbert space. II ⋮ Positive definite dot product kernels in learning theory ⋮ Convergence rate of Newton's method for \(L_2\) spectral estimation ⋮ Interpolation in dynamic equations on time scales ⋮ Reconstruction of functions from prescribed proximal points ⋮ Projection Methods in Conic Optimization ⋮ Incorporating prior knowledge in support vector regression ⋮ Monotone interpolation of scattered data in \({\mathbb{R}}^ s\) ⋮ Armijo Newton method for convex best interpolation ⋮ Constrained best approximation in Hilbert space ⋮ Penalized maximum-likelihood estimation, the Baum-Welch algorithm, diagonal balancing of symmetric matrices and applications to training acoustic data ⋮ On best restricted range approximation in continuous complex-valued function spaces ⋮ Convexity-preserving interpolatory subdivision ⋮ Infinite-dimensional convex programming with applications to constrained approximation ⋮ Quasi interiors, Lagrange multipliers, and \(L^ p\) spectral estimation with lattice bounds

This page was built for publication: Smoothing and Interpolation in a Convex Subset of a Hilbert Space