Duality and well-posedness in convex interpolation∗)
- 1 January 1989
- journal article
- research article
- Published by Taylor & Francis in Numerical Functional Analysis and Optimization
- Vol. 10 (7-8) , 673-689
- https://doi.org/10.1080/01630568908816325
Abstract
We consider the problem for convex interpolation with minimal Lp norm of the second derivative, 1 < p < +α. Convergence of a class of dual methods is established and numerical results are presented. It is proved that if p 2 then the solution of the problem is locally Lipschitz with respect to the data in the uniform metric.Keywords
This publication has 6 references indexed in Scilit:
- Smoothing and Interpolation in a Convex Subset of a Hilbert SpaceSIAM Journal on Scientific and Statistical Computing, 1988
- An Algorithm for Constrained InterpolationSIAM Journal on Scientific and Statistical Computing, 1987
- Constrained interpolation and smoothingConstructive Approximation, 1986
- ConstrainedL p approximationConstructive Approximation, 1985
- Interpolation by smooth functions under restrictions on the derivativesJournal of Approximation Theory, 1980
- On “best” interpolationJournal of Approximation Theory, 1976