Abstract
The study of reverse convex best approximation, that is, of best approximation by complements of convex sets, is motivated, among others, by its connections with the famous unsolved problem whether in a Hilbert space every Chebyshev set (i.e., such that each x ∈ X has a unique element of best approximation in the set) is necessarily convex.
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.
Rights and permissions
Copyright information
© 2006 Springer Science+Business Media, Inc.
About this chapter
Cite this chapter
(2006). Reverse Convex Best Approximation. In: Duality for Nonconvex Approximation and Optimization. CMS Books in Mathematics. Springer, New York, NY. https://doi.org/10.1007/0-387-28395-1_5
Download citation
DOI: https://doi.org/10.1007/0-387-28395-1_5
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-28394-4
Online ISBN: 978-0-387-28395-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)