Duality and well-posedness in convex interpolation∗)

DOI10.1080/01630568908816325MaRDI QIDQ3810285zbMATH OpenOpenAlexFDO

Authors A. L. Dontchev, B. D. Kalchev

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)

Recommendations

• Regularity and well-posedness of a dual program for convex best \(C^{1}\)-spline interpolation
• A dual approach to constrained interpolation from a convex subset of Hilbert space
• scientific article; zbMATH DE number 3981735
• Interpolation and approximation from convex sets
• scientific article; zbMATH DE number 4069488
• scientific article; zbMATH DE number 19345
• Duality in a stability problem for some functionals arising in interpolation theory
• scientific article; zbMATH DE number 3879552
• On the Stability of Multi-dimensional Convexity under Interpolation
• scientific article; zbMATH DE number 65788

Cites work

• scientific article; zbMATH DE number 4069488 (Why is no real title available?)
• An Algorithm for Constrained Interpolation
• Constrained \(L_ p\) approximation
• Constrained interpolation and smoothing
• Interpolation by smooth functions under restrictions on the derivatives
• On 'best' interpolation
• Partially finite convex programming. II: Explicit lattice models
• Smoothing and Interpolation in a Convex Subset of a Hilbert Space

Cited in

(12)

• Convexity of the support of the displacement interpolation: counterexamples
• Shape-preserving interpolation and smoothing for options market implied volatility
• Smooth and semismooth Newton methods for constrained approximation and estimation
• scientific article; zbMATH DE number 4080084 (Why is no real title available?)
• 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
• Dual Bézier curves and convexity preserving interpolation
• Best interpolation in a strip. II: Reduction to unconstrained convex optimization
• Computing the best approximation over the intersection of a polyhedral set and the doubly nonnegative cone
• Regularity and well-posedness of a dual program for convex best \(C^{1}\)-spline interpolation
• scientific article; zbMATH DE number 19345 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3810285)