vix.ing · top · new · best · stats · spec

Global approximation of convex functions

2011/12/05 by Daniel Azagra, Azagra, D.
Computer Science · Mathematics · #26B25 #41A30 #46B20 #49N99 #52A1 #58E99 #Advanced Banach Space Theory #Classical Analysis and ODEs (math.CA) #Differential Geometry (math.DG) #FOS: Mathematics #Fixed Point Theorems Analysis #Functional Analysis (math.FA) #Optimization and Variational Analysis

paper · pdf · doi:10.48550/arxiv.1112.1042

openalex publication_date 2011/12/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Let U⊆ℝn be open and convex. We show that every (not necessarily Lipschitz or strongly) convex function f:U→ℝ can be approximated by real analytic convex functions, uniformly on all of U. In doing so we provide a technique which transfers results on uniform approximation on bounded sets to results on uniform approximation on unbounded sets, in such a way that not only convexity and Ck smoothness, but also local Lipschitz constants, minimizers, order, and strict or strong convexity, are preserved. This transfer method is quite general and it can also be used to obtain new results on approximation of convex functions defined on Riemannian manifolds or Banach spaces. We also provide a characterization of the class of convex functions which can be uniformly approximated on ℝn by strongly convex functions. Finally, we give some counterexamples showing that C0-fine approximation of convex functions by smooth convex functions is not possible on ℝn whenever n≥ 2.

Related