Abstract
We recall that the deviation (or excess) of a set G (assumed nonempty in this chapter, without any special mention) from an element XQ in a normed linear space X is the number δ(G, χ0) ≥ 0 defined by
and any g0∈G for which this sup is attained, i.e., such that
or equivalently, such that
is called an element of worst approximation of (or a farthest point to) x0in G (see Figure 2.1).
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). Worst 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_2
Download citation
DOI: https://doi.org/10.1007/0-387-28395-1_2
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)