Abstract
In many problems that arise in applications, one is given certain function values or “data” along with some reliable evidence that the unknown function that generated the data has a certain shape. For example, the function may be nonnegative or nondecreasing or convex. The problem is to recover the unknown function from this information.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Deutsch, F. (2001). Constrained Interpolation from a Convex Set. In: Best Approximation in Inner Product Spaces. CMS Books in Mathematics / Ouvrages de mathématiques de la SMC. Springer, New York, NY. https://doi.org/10.1007/978-1-4684-9298-9_10
Download citation
DOI: https://doi.org/10.1007/978-1-4684-9298-9_10
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-2890-0
Online ISBN: 978-1-4684-9298-9
eBook Packages: Springer Book Archive