Finiteness Principles for Smooth Convex Functions
Abstract
Let E ⊂ Rn be a compact set, and f:E R. How can we tell if there exists a convex extension F ∈ C1,1(Rn) of f, i.e. satisfying F|E = f|E? Assuming such an extension exists, how small can one take the Lipschitz constant Lip(∇ F): = x,y ∈ Rn, x ≠ y |∇ F(x) - ∇ F(y)||x-y|? We provide an answer to these questions for the class of strongly convex functions by proving that there exist constants k\# ∈ N and C>0 depending only on the dimension n, such that if for every subset S ⊂ E, \#S ≤ k\#, there exists an η-strongly convex function FS ∈ C1,1(Rn) satisfying FS|S=f|S and Lip(∇ FS) ≤ M, then there exists an ηC-strongly convex function F ∈ C1,1c(Rn) satisfying F|E = f|E, and Lip(∇ F) ≤ C M2/η. Further, we prove a Finiteness Principle for the space of convex functions in C1,1(R) and that the sharp finiteness constant for this space is k\#=5.
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.