Related papers: Structural results on convexity relative to cost f…
Recent developments in set optimization are surveyed and extended including various set relations as well as fundamental constructions of a convex analysis for set- and vector-valued functions, and duality for set optimization problems.…
We define and discuss the properties of a class of cost functions on the sphere which we term defective cost functions. We then discuss how to extend these definitions and some properties to cost functions defined on Euclidean space and on…
Over the past years a theory of conjugate duality for set-valued functions that map into the set of upper closed subsets of a preordered topological vector space was developed. For scalar duality theory, continuity of convex functions plays…
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…
We shall prove new contraction properties of general transportation costs along nonnegative measure-valued solutions to Fokker-Planck equations in $R^d$, when the drift is a monotone (or $\lambda$-monotone) operator. A new duality approach…
The classical concept of Fenchel conjugation is tailored to extended real-valued functions defined on linear spaces. In this paper we generalize this concept to functions defined on arbitrary sets that do not necessarily bear any structure…
In this work we derive a convex dual representation for increasing convex functionals on a space of real-valued Borel measurable functions defined on a countable product of metric spaces. Our main assumption is that the functionals fulfill…
Let $X$ and $Y$ be domains of $\mathbb{R}^n$ equipped with respective probability measures $\mu$ and $ \nu$. We consider the problem of optimal transport from $\mu$ to $\nu$ with respect to a cost function $c: X \times Y \to \mathbb{R}$. To…
The dual problem of optimal transportation in Lorentz-Finsler geometry is studied. It is shown that in general no solution exists even in the presence of an optimal coupling. Under natural assumptions dual solutions are established. It is…
In this paper we point out a converse result of the celebrated Jensen inequality for differentiable convex mappings of several variables and apply it to counterpart well-known analytic inequalities. Applications to Shannon's and Renyi's…
Jensen's inequality is ubiquitous in measure and probability theory, statistics, machine learning, information theory and many other areas of mathematics and data science. It states that, for any convex function $f\colon K \to \mathbb{R}$…
This paper studies the application of the blended dynamics approach towards distributed optimization problem where the global cost function is given by a sum of local cost functions. The benefits include (i) individual cost function need…
It has been shown that many first-order methods satisfy the perturbed Fenchel duality inequality, which yields a unified derivation of convergence. More first-order methods are discussed in this paper, e.g., dual averaging and bundle…
A prominent model for transportation networks is branched transport, which seeks the optimal transportation scheme to move material from a given initial to a final distribution. The cost of the scheme encodes a higher transport efficiency…
Mercer inequality for convex functions is a variant of Jensen's inequality, with an operator version that is still valid without operator convexity. This paper is two folded. First, we present a Mercer-type inequality for operators without…
We review several (and provide new) results on the theory of moments, sums of squares and basic semi-algebraic sets when convexity is present. In particular, we show that under convexity, the hierarchy of semidefinite relaxations for…
During the study of the topic of limit summability of functions (introduced by the author in 2001), we encountered some types of functions that are related to the mean value theorem. In this paper, we formally define mean value and…
Geometric duality theory for multiple objective linear programming problems turned out to be very useful for the development of efficient algorithms to generate or approximate the whole set of nondominated points in the outcome space. This…
Let $L=\DD+Z$ for a $C^1$ vector field $Z$ on a complete Riemannian manifold possibly with a boundary. By using the uniform distance, a number of transportation-cost inequalities on the path space for the (reflecting) $L$-diffusion process…
In this paper we are concerned with a Gordan-type theorem involving an arbitrary number of inequality functions. We not only state its validity under a weak convexity assumption on the functions, but also show it is an optimal result. We…