Related papers: Discrete Midpoint Convexity
We study the asymptotic shape of the trajectory of the stochastic gradient descent algorithm applied to a convex objective function. Under mild regularity assumptions, we prove a functional central limit theorem for the properly rescaled…
The concept of convex compactness, weaker than the classical notion of compactness, is introduced and discussed. It is shown that a large class of convex subsets of topological vector spaces shares this property and that is can be used in…
WDC sets in ${\mathbb R}^d$ were recently defined as sublevel sets of DC functions (differences of convex functions) at weakly regular values. They form a natural and substantial generalization of sets with positive reach and still admit…
We study Leinster's notion of magnitude for a compact metric space. For a smooth, compact domain $X\subset \mathbb{R}^{2m-1}$, we find geometric significance in the function $\mathcal{M}_X(R) = \mathrm{mag}(R\cdot X)$. The function…
In this work, we introduce the class of $h$-${\rm{MN}}$-convex functions by generalizing the concept of ${\rm{MN}}$-convexity and combining it with $h$-convexity. Namely, Let $I,J$ be two intervals subset of $\left(0,\infty\right)$ such…
Set-functions appear in many areas of computer science and applied mathematics, such as machine learning, computer vision, operations research or electrical networks. Among these set-functions, submodular functions play an important role,…
We investigate a class of composite nonconvex functions, where the outer function is the sum of univariate extended-real-valued convex functions and the inner function is the limit of difference-of-convex functions. A notable feature of…
In this paper, we derive new estimates for the remainder term of the midpoint, trapezoid, and Simpson formulae for functions whose derivatives in absolute value at certain power are quasi-convex. Some applications to special means of real…
In the present paper, we introduce a new concept of convexity which is generated by a family of endomorphisms of an Abelian group. In Abelian groups equipped with a translation invariant metric, we define the boundedness, the norm, the…
Variational convexity, together with ist strong counterpart, of extended-real-valued functions has been recently introduced by Rockafellar. In this paper we present second-order characterizations of these properties, i.e., conditions using…
Pseudoconvexity of a domain in $\Bbb C^n$ is described in terms of the existence of a locally defined plurisubharmonic/holomorphic function near any boundary point that is unbounded at the point.
If $u : \Omega\subset \mathbb{R}^d \to {\rm X}$ is a harmonic map valued in a metric space ${\rm X}$ and ${\sf E} : {\rm X} \to \mathbb{R}$ is a convex function, in the sense that it generates an ${\rm EVI}_0$-gradient flow, we prove that…
The main contribution of this paper is that every convex function with non-empty relative algebraic interior of its domain is Lipschitz and subdifferentiable in some algebraic sense without any additional topological constraints. The…
In many naturally occurring optimization problems one needs to ensure that the definition of the optimization problem lends itself to solutions that are tractable to compute. In cases where exact solutions cannot be computed tractably, it…
The optimization problem concerning the determination of the minimizer for the sum of convex functions holds significant importance in the realm of distributed and decentralized optimization. In scenarios where full knowledge of the…
An equidistant set in the Euclidean space consists of points having equal distances to both members of a given pair of sets, called focal sets. Since there is no effective formula to compute the distance of a point and a set, it is hard to…
Error bounds are central objects in optimization theory and its applications. They were for a long time restricted only to the theory before becoming over the course of time a field of itself. This paper is devoted to the study of error…
This paper gives some relating results for various concepts of convexity in metric spaces such as midpoint convexity, convex structure, uniform convexity and near-uniform convexity, Busemann curvature and its relation to convexity. Some…
Hadwiger's Theorem states that Euclidean-invariant convex-continuous valuations of definable sets are linear combinations of intrinsic volumes. We lift this result from sets to data distributions over sets, specifically, to definable…
Let $U\subseteq\mathbb{R}^d$ be open and convex. We prove that every (not necessarily Lipschitz or strongly) convex function $f:U\to\mathbb{R}$ can be approximated by real analytic convex functions, uniformly on all of $U$. We also show…