On farthest points of sets
On farthest points of sets (scientific article; zbMATH DE number 5155511)
Let \(E\) be a Banach space and \(A\subset E\) be a bounded closed convex set. Let \(f_{A}:E\rightarrow\mathbb{R},\;f_{A}(x)=\sup\{\left\| x-a\right\| :a\in A\}\) be the farthest point function for \(A.\) For \(x\in E\), let \(a(x)\in A\) be the farthest point from \(x,\) i.e., \(\left\| x-a(x)\right\| =f_{A}(x)\) and \(\left\| x-a\right\| <f_{A}(x),\) for all \(a\in A\backslash\{a(x)\}.\) The set \(A\) is called strongly convex of radius \(R>0\) if it is an intersection of balls of radius \(R,\) and is called a generating set if, for every intersection of translates \(B=\bigcap_{x\in E}(A+x)\neq\emptyset\), there is a set \(A_{1}\) such that \(B+A_{1}=A.\) For \(A\subset E\) and \(r>0\), one defines \(T_{r}=T_{r}(A)=\{x\in A| \;f_{A} (x)>r\}.\) The set \(A\) is called a strong \(r\)-sun if any point \(a(x)\) that is the farthest point from a point \(x\in T_{r}\) is also the farthest point from any \(w\) lying on the segment \([x_{i}a(x)]\) and satisfying the inequality \(\left\| w-a(x)\right\| >r.\) The authors obtain some results concerning the existence and uniqueness of farthest points, and necessary and sufficient conditions for the strong convexity of a set, such as: Theorem~1. If \(E\) is a reflexive Banach space with strongly convex and generating ball, then for every \(A\subset E,\) strongly convex of radius \(r>0,\) there exists the farthest point \(a(x),\) for every \(x\in T_{r}(A)\). Theorem~2. If \(A\) is strongly convex of radius \(r>0\) in a Hilbert space \(H,\) then for every \(x\in T_{r}(A)\) there is \(a(x)\in A\) and \(\left\| a(x_{1} )-a(x_{2})\right\| \leq\frac{r}{R-r}\left\| x_{1}-x_{2}\right\| ,\) for every \(R>r\) and \(x_{1},x_{2}\in T_{R}\).
- On existence of farthest points
- Sets associated with the farthest point problem
- Monotonicity and the dominated farthest points problem in Banach lattice
- Farthest points and strong convexity of sets
- Extending and paralleling Stechkin's category theorem
- Solarity of sets in max-approximation problems
- Ball convex bodies in Minkowski spaces
- On random farthest points.
- The NSLUC property and Klee envelope
- Extreme points and descriptive sets
- Ambiguous loci of the farthest distance mapping from compact convex sets
- The farthest and the nearest points of sets
- scientific article; zbMATH DE number 1930370 (Why is no real title available?)
- scientific article; zbMATH DE number 4686 (Why is no real title available?)
- The Pliś metric and Lipschitz stability of minimization problems
- Various perturbations and relaxations of the sweeping process
- Farthest distance function to strongly convex sets
- Convexities and existence of the farthest point
- Dual characterizations of three distance functions
- Farthest points of bounded closed sets
- Sharper approximation of extreme points by far points
- Strongly convex sets with variable radii
- Lipschitz differentiability of the supporting function from a geometric viewpoint, the nearest and the farthest points
- From utility functions and generalized means to distance functions: a Stone-Geary approach and related duality results
This page was built for publication: On farthest points of sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5899407)
