Bregman distances and Chebyshev sets

Details Bregman distances and Chebyshev sets Bregman distances and Chebyshev sets

2007-12-24

arxiv.org/abs/0712.4030v1

Mathematics

Functional Analysis

Scientific paper

A closed set of a Euclidean space is said to be Chebyshev if every point in the space has one and only one closest point in the set. Although the situation is not settled in infinite-dimensional Hilbert spaces, in 1932 Bunt showed that in Euclidean spaces a closed set is Chebyshev if and only if the set is convex. In this paper, from the more general perspective of Bregman distances, we show that if every point in the space has a unique nearest point in a closed set, then the set is convex. We provide two approaches: one is by nonsmooth analysis; the other by maximal monotone operator theory. Subdifferentiability properties of Bregman nearest distance functions are also given.

Affiliated with

Also associated with

No associations

Rating

Bregman distances and Chebyshev sets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Bregman distances and Chebyshev sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bregman distances and Chebyshev sets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-184637