Finite termination of a dual Newton method for convex best \(C^1\) interpolation and smoothing

DOI10.1007/S00211-003-0471-ZzbMath1081.65015OpenAlexW2028816462MaRDI QIDQ2570654

Liqun Qi, Hou-Duo Qi

Publication date: 28 October 2005

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00211-003-0471-z

zbMATH Keywords

smoothingcubic splinesNewton methodconvex interpolationbest interpolation

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Numerical interpolation (65D05) Approximation with constraints (41A29) Spline approximation (41A15)

Related Items (1)

Regularity and well-posedness of a dual program for convex best \(C^{1}\)-spline interpolation

This page was built for publication: Finite termination of a dual Newton method for convex best \(C^1\) interpolation and smoothing