Farthest Distance Function to Strongly Convex Sets
Copyright policy )Farthest Distance Function to Strongly Convex Sets
The aim of the present paper is twofold. On one hand, we show that the strong convexity of a set is equivalent to the semiconcavity of its associated farthest distance function. On the other hand, we establish that the farthest distance of a point from a strongly convex set is the minimum of farthest distances of the given point from suitable closed balls separating the set and the point. Various other results on strongly convex sets are also provided.
variational analysis, prox-regularity, farthest distance function, Nonsmooth analysis, [MATH] Mathematics [math], strong convexity, semiconvexity, Set-valued and variational analysis
variational analysis, prox-regularity, farthest distance function, Nonsmooth analysis, [MATH] Mathematics [math], strong convexity, semiconvexity, Set-valued and variational analysis
citations The total number of citations received by all articles of the researcher of interest.3 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!