Related papers: Global and fine approximation of convex functions

In this paper, we unify and improve existing results on characterizing strict and almost stricty convex functions via subdifferential mapping, Moreau envelope, and proximal mappings. In particular, it is shown that if a convex function is…

In this short note, we extend the linear convergence result of the Cauchy algorithm, derived recently by E. Klerk, F. Glineur, and A. Taylor, from the case of smooth strongly convex functions to the case of restricted strongly convex…

We characterize embedded $\C^1$ hypersurfaces of $\R^n$ as the only locally closed sets with continuously varying flat tangent cones whose measure-theoretic-multiplicity is at most $m<3/2$. It follows then that any (topological)…

The piecewise-concave function may be used to approximate a wide range of other functions to arbitrary precision over a bounded set. In this short paper, this property is proven for three function classes: (a) the multivariate twice…

In this work, we construct a proximal average for two prox-bounded functions, which recovers the classical proximal average for two convex functions. The new proximal average transforms continuously in epi-topology from one proximal hull to…

Let u be a subharmonic function in D={|z|<1}. There exist an absolute constant C and an analytic function f in D such that \int_D |u(z)-log|f(z)|| dm(z)<C where m denotes the plane Lebesgue measure. We also consider uniform approximation.

We consider the space of functions almost in $L_p$ and endow it with the topology of asymptotic $L_p$-convergence. This yields a completely metrizable topological vector space which, on finite measure spaces, coincides with the space of…

For continuous functions, midpoint convexity characterizes convex functions. By considering discrete versions of midpoint convexity, several types of discrete convexities of functions, including integral convexity, L$^\natural$-convexity…

This paper concerns the universal approximation property with neural networks in variable Lebesgue spaces. We show that, whenever the exponent function of the space is bounded, every function can be approximated with shallow neural networks…

By studying $\mathbb{A}^1$-curves on varieties, we propose a geometric approach to strong approximation problem over function fields of complex curves. We prove that strong approximation holds for smooth, low degree affine complete…

Let $C$ be a subset of $\mathbb{R}^n$ (not necessarily convex), $f:C\to\mathbb{R}$ be a function, and $G:C\to\mathbb{R}^n$ be a uniformly continuous function, with modulus of continuity $\omega$. We provide a necessary and sufficient…

Let $X$ be a separable real Hilbert space. We show that for every Lipschitz function $f:X\rightarrow\mathbb{R}$, and for every $\epsilon>0$, there exists a Lipschitz, real analytic function $g:X\rightarrow\mathbb{R}$ such that…

Let $X$ be a normed space of a finite dimension at least two, and $C\subsetneq X$ a closed convex set with nonempty interior. We are interested in extending Lipschitz quasiconvex functions on $C$ to quasiconvex functions on $X$. We show…

Let $\Omega$ be a bounded pseudoconvex domain in $\mathbb{C}^N$. Given a continuous plurisubharmonic function $u$ on $\Omega$, we construct a sequence of Gaussian analytic functions $f_n$ on $\Omega$ associated with $u$ such that…

In this paper we discuss convexity, its average principle, an extrinsic average variational method in the Calculus of Variations, an average method in Partial Differential Equations, a link of convexity to $p$-subharmonicity, subsolutions…

We prove that every continuous mapping from a separable infinite-dimensional Hilbert space $X$ into $\mathbb{R}^{m}$ can be uniformly approximated by $C^\infty$ smooth mappings {\em with no critical points}. This kind of result can be…

Given a finite number of samples of a continuous set-valued function F, mapping an interval to non-empty compact subsets of $\mathbb{R}^d$, $F: [a,b] \to K(\mathbb{R}^d)$, we discuss the problem of computing good approximations of F. We…

Given a convex set $C$ in a real vector space $E$ and two points $x,y\in C$, we investivate which are the possible values for the variation $f(y)-f(x)$, where $f:C\longrightarrow [m,M]$ is a bounded convex function. We then rewrite the…

Let $\Delta_m$ be the standard $m$-dimensional simplex of non-negative $m+1$ tuples that sum to unity and let $S$ be a nonempty subset of $\Delta_m$. A real valued function $h$ defined on a convex subset of a real vector space is $S$-almost…

When computing bounds, spatial branch-and-bound algorithms often linearly outer approximate convex relaxations for non-convex expressions in order to capitalize on the efficiency and robustness of linear programming solvers. Considering…