Related papers: Convex Sets and Minimal Sublinear Functions

We present a minimax optimal solution to the problem of estimating a compact, convex set from finitely many noisy measurements of its support function. The solution is based on appropriate regularizations of the least squares estimator.…

In this paper we establish a general framework in which the verification of support theorems for generalized convex functions acting between an algebraic structure and an ordered algebraic structure is still possible. As for the domain…

Let $\Omega\subset\mathbb{R}^{d}$ be an open set. Given a boundary datum $g$ on $\partial\Omega$ and a function $K:\bar {\Omega} \to\mathcal{K}$, the family of all compact convex subsets of $\mathbb{R}^{d}$, we prove the existence of…

In this paper we investigate k-submodular functions. This natural family of discrete functions includes submodular and bisubmodular functions as the special cases k = 1 and k = 2 respectively. In particular we generalize the known…

In this paper we give a characterization of all order isomorphisms on some classes of convex functions. We deal with the class $Cvx(K)$ consisting of lower-semi-continuous convex functions defined on a convex set $K$, and its subclass…

We study extremal properties of the function $$ F(x) := \min\{k\|x\|^{1-1/k}\colon k\ge 1\},\ x\in[0,1], $$ where $\|x\|=\min\{x,1-x\}$. In particular, we show that $F$ is the pointwise largest function of the class of all real-valued…

In this paper, we study a geometric property of a continuous plurisubharmonic function which is a solution of the Monge-Amp\`ere equation and has a convex level set. To prove our main theorem, we show a minimum principle of a maximal…

This paper gives two different proofs to a structural theorem of decreasing minimization (lexicographic optimization) on integrally convex sets. The theorem states that the set of decreasingly minimal elements of an integrally convex set…

An invex function generalizes a convex function in the sense that every stationary point is a global minimizer. Recently, invex functions and their subclasses have attracted attention in signal processing and machine learning. However,…

The aim of this paper is to present an original approach that takes advantage from the geometric features of strictly convex functions to tackle the problem of finding the minimum from another perspective. The general idea is that near the…

We define in the space of n by m matrices of rank n, n less or equal than m, the condition Riemannian structure as follows: For a given matrix A the tangent space of A is equipped with the Hermitian inner product obtained by multiplying the…

We show that minimizing a convex function over the integer points of a bounded convex set is polynomial in fixed dimension.

We prove that certain Bellman functions of several variables are the minimal locally concave functions. This generalizes earlier results about Bellman functions of two variables.

This work is concerned with the convex analysis of functions defined on (not necessarily finite-dimensional) Hilbert spaces whose values depend solely on a certain ``spectrum'' of the arguments, a class we term ``spectral functions.'' We…

Let $K \subset \mathbb R^n$ be a convex body with barycenter at the origin. We show there is a simplex $S \subset K$ having also barycenter at the origin such that $\left(\frac{vol(S)}{vol(K)}\right)^{1/n} \geq \frac{c}{\sqrt{n}},$ where…

Submodularity is an important concept in combinatorial optimization, and it is often regarded as a discrete analog of convexity. It is a fundamental fact that the set of minimizers of any submodular function forms a distributive lattice.…

It is shown that, for any function $g$ that is weakly increasing on compact convex sets and has the property that if $\lambda\ge 0$ and $K^\prime$ is a translate of $\lambda K$ then $g(K^\prime) =\lambda g(K)$, then for any covering…

In this paper we introduce two conceptual algorithms for minimising abstract convex functions. Both algorithms rely on solving a proximal-type subproblem with an abstract Bregman distance based proximal term. We prove their convergence when…

This paper considers the minimization problem of relaxed submodular functions. For a positive integer $k$, a set function is called $k$-distant submodular if the submodular inequality holds for every pair whose symmetric difference is at…

We study containment and uniqueness problems concerning matrix convex sets. First, to what extent is a matrix convex set determined by its first level? Our results in this direction quantify the disparity between two product operations,…