An Algorithm for Constrained Interpolation

DOI10.1137/0908082zbMath0632.65008OpenAlexW1979152443MaRDI QIDQ3769835

Tommy Elfving, Lars-Erik Andersson

Publication date: 1987

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

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

zbMATH Keywords

iterative methodsnonlinear system of equationsconstrained interpolationconvex spline interpolationNewton type algorithm

Mathematics Subject Classification ID

Numerical computation using splines (65D07) Numerical interpolation (65D05) Spline approximation (41A15)

Related Items (13)

An algorithm for computing constrained smoothing spline functions ⋮ MONOTONE APPROXIMATION OF AGGREGATION OPERATORS USING LEAST SQUARES SPLINES ⋮ Best interpolation in a strip. II: Reduction to unconstrained convex optimization ⋮ A Newton-type algorithm for solving an extremal constrained interpolation problem ⋮ Interpolation and approximation by monotone cubic splines ⋮ Duality and well-posedness in convex interpolation^∗) ⋮ A survey on univariate data interpolation and approximation by splines of given shape ⋮ No-arbitrage interpolation of the option price function and its reformulation ⋮ Armijo Newton method for convex best interpolation ⋮ 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 ⋮ An algorithm for constrained smoothing functions

This page was built for publication: An Algorithm for Constrained Interpolation