Mutually nearest and mutually farthest points of sets in geodesic spaces

Abstract

Let A and X be nonempty, bounded and closed subsets of a geodesic metric space (E,d). The minimization (resp. maximization) problem denoted by (A,X) (resp. (A,X)) consists in finding (a0,x0) ∈ A × X such that d(a0,x0) = ∈f\d(a,x) : a ∈ A, x ∈ X\ (resp. d(a0,x0) = \d(a,x) : a ∈ A, x ∈ X\). We study the well-posedness of these problems in different geodesic spaces considering the set A fixed. Let Pb,cl,cv(E) be the space of all nonempty, bounded, closed and convex subsets of E endowed with the Pompeiu-Hausdorff distance. We show that in a space with a convex metric, curvature bounded below and the geodesic extension property, the family of sets in Pb,cl,cv(E) for which (A,X) is well-posed is a dense Gδ-set in Pb,cl,cv(E). We give a similar result for (A,X) without needing the geodesic extension property. Besides, we analyze the situations when one set or both sets are compact and prove some results specific to CAT(0) spaces. We also prove a variant of the Drop theorem in geodesic spaces with a convex metric and apply it to obtain an optimization result for convex functions.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…