Convex functions with unbounded gradient

2005/04/28 by Oliver C. Schnürer, Schnürer, Oliver C.
Computer Science · Mathematics · #Analysis of PDEs (math.AP) #Analytic and geometric function theory #Classical Analysis and ODEs (math.CA) #Differential Geometry (math.DG) #FOS: Mathematics #Optimization and Variational Analysis #math.AP #math.CA #math.DG

paper · pdf · doi:10.48550/arxiv.math/0504567

5 pages, 1 figure, incorrect example removed

openalex publication_date 2005/04/28 · arxiv created 2005/09/20 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We show that domains, that allow for convex functions with unbounded gradient at their boundary, are convex.

Related

• The planar Least Gradient problem in convex domains
• Determination of (unbounded) convex functions via Crandall-Pazy directions
• Extension of Convex Function
• A convex function satisfying the Lojasiewicz inequality but failing the gradient conjecture both at zero and infinity
• On the Properties of Convex Functions over Open Sets