Unique Minimizers and the Representation of Convex Envelopes in Locally Convex Vector Spaces
Abstract
It is well known that a strictly convex minimand admits at most one minimizer. We prove a partial converse: Let X be a locally convex Hausdorff space and f X ( - ∞ , ∞ ] a function with compact sublevel sets and exhibiting some mildly superlinear growth. Then each tilted minimization problem equation eq. minimization problem x ∈ X f(x) - x' , x X equation admits at most one minimizer as x' ranges over dom ( ∂ f* ) if and only if the biconjugate f** is essentially strictly convex and agrees with f at all points where f** is subdifferentiable. We prove this via a representation formula for f** that might be of independent interest.
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.