Bregman distances and Klee sets

Details Bregman distances and Klee sets Bregman distances and Klee sets

2008-02-16

arxiv.org/abs/0802.2322v1

Mathematics

Functional Analysis

Scientific paper

In 1960, Klee showed that a subset of a Euclidean space must be a singleton provided that each point in the space has a unique farthest point in the set. This classical result has received much attention; in fact, the Hilbert space version is a famous open problem. In this paper, we consider Klee sets from a new perspective. Rather than measuring distance induced by a norm, we focus on the case when distance is meant in the sense of Bregman, i.e., induced by a convex function. When the convex function has sufficiently nice properties, then - analogously to the Euclidean distance case - every Klee set must be a singleton. We provide two proofs of this result, based on Monotone Operator Theory and on Nonsmooth Analysis. The latter approach leads to results that complement work by Hiriart-Urruty on the Euclidean case.

Affiliated with

Also associated with

No associations

Rating

Bregman distances and Klee 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 Klee sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bregman distances and Klee sets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-248098