Duality and well-posedness in convex interpolation∗)

DOI10.1080/01630568908816325zbMath0661.41004OpenAlexW2047668748MaRDI QIDQ3810285

B. D. Kalchev, Asen L. Dontchev

Publication date: 1989

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630568908816325

zbMATH Keywords

numerical methodswell-posednessduality approachshape preserving interpolation problems

Mathematics Subject Classification ID

Interpolation in approximation theory (41A05) Spline approximation (41A15)

Related Items (8)

Smooth and Semismooth Newton Methods for Constrained Approximation and Estimation ⋮ Regularity and well-posedness of a dual program for convex best \(C^{1}\)-spline interpolation ⋮ Best interpolation in a strip. II: Reduction to unconstrained convex optimization ⋮ Iteration methods for convexly constrained ill-posed problems in hilbert space ⋮ Partially finite convex programming. II: Explicit lattice models ⋮ 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

Cites Work

• Unnamed Item
• Constrained \(L_ p\) approximation
• Constrained interpolation and smoothing
• Interpolation by smooth functions under restrictions on the derivatives
• Partially finite convex programming. II: Explicit lattice models
• On 'best' interpolation
• An Algorithm for Constrained Interpolation
• Smoothing and Interpolation in a Convex Subset of a Hilbert Space

This page was built for publication: Duality and well-posedness in convex interpolation^∗)