Compensated Convex Transforms and Geometric Singularity Extraction from Semiconvex Functions

Abstract

We apply upper and lower compensated convex transforms, which are `tight' one-sided approximations of a given function, to the extraction of fine geometric singularities from semiconvex/semiconcave functions and DC-functions in Rn (difference of convex functions). Well-known examples of (locally) semiconcave functions include the Euclidean distance and squared distance functions. For a locally semiconvex function f with general modulus, we show that `locally' a point is a singular (non-differentiable) point if and only if it is a scale 1-valley point, and if x is a singular point, then locally the limit of the scaled valley transform exists at every point x and λ ∞λ Vλ (f)(x)=rx2/4, where rx is the radius of the minimal bounding sphere of the (Fr\'echet) subdifferential ∂- f(x) and Vλ (f)(x) is the valley transform at x. Thus the limit function V∞(f)(x):=λ+∞λ Vλ (f)(x)=rx2/4 gives a `scale 1-valley landscape function' of the singular set for a locally semiconvex function f, and also provides an asymptotic expansion of the upper transform Cuλ(f)(x) when λ ∞. For a locally semiconvex function f with linear modulus we show that the limit of the gradient of the upper compensated convex transform λ+∞∇ Cuλ(f)(x) exists and equals the centre of the minimal bounding sphere of ∂- f(x, and that for a DC-function f=g-h, the scale 1-edge transform satisfies λ+∞λ Eλ (f)(x)≥ (rg,x-rh,x)2/4, where rg,x and rh,x are the radii of the minimal bounding spheres of the subdifferentials ∂- g and ∂- h of the convex functions g and h at x respectively.

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…