0
votes
0answers
39 views

minimum distance between sets and relation with functions [on hold]

Let $A, B$ be two convex and closed subsets of $\mathbb{R}^n$. We would like to the minimum distance between these two sets. i.e., we want to find a solution for the following problem. $$ \min ...
2
votes
5answers
187 views

Distance between two sets

Let $A, B$ be two convex and closed subsets of $\mathbb{R}^n$. We would like to the minimum distance between these two sets. i.e., we want to find a solution for the following problem. $$ \min ...
3
votes
1answer
155 views

Characterization of a set in $\mathbb{R}^d$

Let $X= (X_1,\dots, X_d)$ be a fixed vector of random variables on the space $(\Omega, \mathcal{F}, \mathbb{P})$. Consider the following set. \begin{equation}\label{main12} C= \{x\in \mathbb{R}^d ~|~ ...
1
vote
0answers
86 views

Linearization of cones

Suppose that $K$ is a closed convex cone in $R^{n}$. Is there a "nice" function $f:R^{n} \rightarrow R^{m}$ so that $f(K)$ is a subspace? What about an approximate subspace?
2
votes
1answer
378 views

Integral inequality for convex function

Let $u(x)$ be a smooth function from $\mathbb{R}$ to $\mathbb{R}$. Suppose that for some real numbers $a,b$ with $a < b$ the following equality is true: \begin{equation} \frac{1}{b-a} \int_a^b ...
1
vote
1answer
218 views

When does the finite union of convex sets have a hole in it?

Let $f_1, \dots, f_j$ be convex functions from $\mathbb{R}^n \to \mathbb{R}$. I am trying to develop a test that decides whether or not the set $\{x | f_1(x) \le k_1\} \cup \dots \cup \{x | f_n(x) ...
3
votes
1answer
237 views

Possible to find a set of log-concave functions with log-concave sums?

While the set of log-convex functions is closed under addition, the set of log-concave functions is not. Yet if $f$ is log-concave, $\ln(k f) = \ln(k)+\ln(f)$, with $k \in \mathbb{R}^+$ constant, is ...