Related papers: Note on Minkowski Summation and Unimodularity in D…
We use the definition of a fractional integral, recently proposed by Katugampola, to establish a generalization of the reverse Minkowski's inequality. We show two new theorems associated with this inequality, as well as state and show other…
A min-max formula is proved for the minimum of an integer-valued separable discrete convex function where the minimum is taken over the set of integral elements of a box total dual integral (box-TDI) polyhedron. One variant of the theorem…
We show that the natural "convolution" on the space of smooth, even, translation-invariant convex valuations on a euclidean space $V$, obtained by intertwining the product and the duality transform of S. Alesker, may be expressed in terms…
The Shapley-Folkman theorem shows that Minkowski averages of uniformly bounded sets tend to be convex when the number of terms in the sum becomes much larger than the ambient dimension. In optimization, Aubin and Ekeland [1976] show that…
Many works on inverse problems in the imaging sciences consider regularization via one or more penalty functions or constraint sets. When the models/images are not easily described using one or a few penalty functions/constraints, additive…
In this paper, the $q$-th dual curvature measure is extended to convex functions and the associated Minkowski problem is posed. A special case includes the $q$-th dual curvature measure of convex bodies which defined by Huang, Lutwak, Yang…
A Minkowski class is a closed subset of the space of convex bodies in Euclidean space Rn which is closed under Minkowski addition and non-negative dilatations. A convex body in Rn is universal if the expansion of its support function in…
Our goal is to present a new shorter proof for the maximal monotonicity of the Minkowski sum of two maximal monotone multi-valued operators defined in a reflexive Banach space under the classical interiority condition involving their…
We propose to derive deviation measures through the Minkowski gauge of a given set of acceptable positions. We show that, given a suitable acceptance set, any positive homogeneous deviation measure can be accommodated in our framework. In…
We present several analogies between convex geometry and the theory of holomorphic line bundles on smooth projective varieties or K\"ahler manifolds. We study the relation between positive products and mixed volumes. We define and study a…
Consider a sum of convex functions, where the only information known about each individual summand is the location of a minimizer. In this work, we give an exact characterization of the set of possible minimizers of the sum. Our results…
A new directional derivative and a new subdifferential for set-valued convex functions are constructed, and a set-valued version of the so-called 'max-formula' is proven. The new concepts are used to characterize solutions of convex…
The main purpose of this note is to prove an upper bound on the number of lattice points of a centrally symmetric convex body in terms of the successive minima of the body. This bound improves on former bounds and narrows the gap towards a…
Analogues of the classical inequalities from the Brunn-Minkowski theory for rotation intertwining additive maps of convex bodies are developed. Analogues are also proved of inequalities from the dual Brunn-Minkowski theory for intertwining…
The purpose of this short note, is to rewrite Morozov's formula for correlation functions over the unitary group, in a much simpler form, involving the computation of a single determinant.
This paper continues the study of a class of compact convex hypersurfaces in Euclidean space $R^{n+1}, ~n \geq 1$, which are boundaries of compact convex bodies obtained by taking the intersection of (solid) confocal paraboloids of…
A fundamental theorem in discrete convex analysis states that a set function is M$^\natural$-concave if and only if its conjugate function is submodular. This paper gives a new proof to this fact.
We propose a novel proof technique that can be applied to attack a broad class of problems in computational complexity, when switching the order of universal and existential quantifiers is helpful. Our approach combines the standard min-max…
Minkowski sums are of theoretical interest and have applications in fields related to industrial backgrounds. In this paper we focus on the specific case of summing polytopes as we want to solve the tolerance analysis problem described in…
A key idea in convex optimization theory is to use well-structured affine functions to approximate general functions, leading to impactful developments in conjugate functions and convex duality theory. This raises the question: what are the…