Duality and well-posedness in convex interpolation∗)
From MaRDI portal
Publication:3810285
DOI10.1080/01630568908816325zbMATH Open0661.41004OpenAlexW2047668748MaRDI QIDQ3810285FDOQ3810285
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
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
- Partially finite convex programming. II: Explicit lattice models
- Smoothing and Interpolation in a Convex Subset of a Hilbert Space
- Constrained \(L_ p\) approximation
- Constrained interpolation and smoothing
- An Algorithm for Constrained Interpolation
- Interpolation by smooth functions under restrictions on the derivatives
- On 'best' interpolation
- Title not available (Why is that?)
Cited In (12)
- Convexity of the support of the displacement interpolation: counterexamples
- 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
- Partially finite convex programming. II: Explicit lattice models
- Title not available (Why is that?)
- Best interpolation in a strip. II: Reduction to unconstrained convex optimization
- Shape-preserving interpolation and smoothing for options market implied volatility
- Smooth and semismooth Newton methods for constrained approximation and estimation
- Title not available (Why is that?)
- Armijo Newton method for convex best interpolation
- Dual Bézier curves and convexity preserving interpolation
- Iteration methods for convexly constrained ill-posed problems in hilbert space
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)
