The Nearest Point Theorem for Weakly Convex Sets in Asymmetric Seminormed Spaces
Weakly convex sets in asymmetric seminormed spaces are considered. We prove that any point from some neighborhood of such a set has the unique nearest point in the set. The proof of the nearest point theorem is based on the theorem about the diameter of \(\varepsilon \)-projection which is also important in approximation theory. The notion of weakly convex sets in asymmetric seminormed spaces generalizes known notions of sets with positive reach, proximal smooth sets, and prox-regular sets. By taking the Minkowski functional of the epigraph of some convex function as a seminorm, the results obtained for weakly convex sets can be applied to weakly convex functions whose graphs are weakly convex sets with respect to this seminorm.
KeywordsWeakly convex sets Asymmetric seminorm Metric projection
- 18.Fenchel, W.: Convex Cones, Sets and Functions. Mimeographed Lecture Notes, Princeton University (1951)Google Scholar
- 23.Ivanov, G.E., Thibault, L.: Well-posedness and subdifferentials of optimal value and infimal convolution. Set Valued Var. Anal. 1–21 (2018). https://doi.org/10.1007/s11228-018-0493-4