# Tagged Questions

**4**

votes

**2**answers

117 views

### When does a cone contain its dual cone?

Let $V$ be a finite-dimensional vector space with an inner-product $(,)$ and let $C\subset V$ be a cone in $V$. Let $C^\vee$ denote the dual of $C$ with respect to $(,)$, i.e., the set of vector $v\in ...

**1**

vote

**0**answers

67 views

### Convex Optimization related problem

Suppose two non-negative convex functions $f$ and $g$ be given.
We want to solve the following optimization
$$\max_{g\leq\epsilon}f.$$
Now suppose that both $f$ and $g$ can be upper-bounded by a ...

**2**

votes

**0**answers

76 views

### Lower convex envelope of a function involving entropy

Suppose two discrete random variables $X$ and $Y$ defined on finite sets $\mathcal{X}$ and $\mathcal{Y}$ are given and also suppose the conditional distribution $P_{Y|X}$ (i.e, channel) is fixed. We ...

**2**

votes

**0**answers

100 views

### Convex functions with non-singular hessian measure are continuously differentiable?

It is known that every convex function $f: \Omega\to \mathbb{R}$, $\Omega$ convex subset of $\mathbb{R}^n$, has a weak derivative of bounded variation $Df\in BV_{loc}(\mathbb{R}^n)$ (e.g. Evans and ...

**0**

votes

**0**answers

76 views

### additive support functions of a convex set

Let $K \subset \mathbb{R}^d$ be a compact, convex set. It could be uniquely determined by its support function (for $u$ on the unit-sphere $S^{d-1}$), given by
$$h_K(u) = \sup \{ \sum_{i=1}^d x_i ...

**-1**

votes

**1**answer

85 views

### Exponential Convexity Results [closed]

$\textbf{Definition:}$ 1. A function $h : (a,b)\rightarrow\mathbb{R}$ is exponentially convex if it is continuous
and
$$\sum _{i, j=1}^n\xi_i\xi_jh(x_i+x_j)\geq 0,$$
for all $n\in\mathbb{N}$ and all ...

**0**

votes

**1**answer

132 views

### Exponential Convexity

$\textbf{Definition:}$ 1. A function $h : (a,b)\rightarrow\mathbb{R}$ is exponentially convex if it is continuous
and
$$\sum _{i, j=1}^n\xi_i\xi_jh(x_i+x_j)\geq 0,$$
for all $n\in\mathbb{N}$ and all ...

**11**

votes

**0**answers

169 views

### How large are the smallest-area projections of a high-dimensional convex body?

Let $B$ be a convex body in $\mathbb{R}^d$, equipped with its standard Euclidean form, and assume that
$$\intop_B x \, dx = 0$$
$$\frac{1}{|B|_d} \intop_B x_i x_j \, dx = \delta_{ij},$$
a ...

**1**

vote

**0**answers

63 views

### Directional derivates and unique subgradients

I have a question about the fine structure of convex functions. Convex functions behave very regular in the interior of their domain of definition (e.g. they are locally Lipschitz continuous there) ...

**-1**

votes

**1**answer

46 views

### Determining the sign of each element of the optimal of a strict convex function

The problem is:
Let $\vec{x}\in\mathbb{R}^d$ be the variable and $f(\vec{x})$ be a scalar function that is globally strictly convex in $\mathbb{R}^d$. We assume the unique optimum of $f$ to be ...

**0**

votes

**0**answers

100 views

### Uniform convergence of difference quotients of a convex function

Let $f(\cdot):\mathbb{R}^n\rightarrow \mathbb{R}$ be a convex function. At $x$ denote the subdifferential by $\partial f(x)$ which is compact and closed. Now, define the approximation of $f$ around a ...

**1**

vote

**1**answer

182 views

### How to examine the convexity of a complex function numerically?

I have a function which does not have a closed form . Large numerical effort should be done to evaluate the function for even a single point. How can I examine the convexity of my function over the ...

**1**

vote

**0**answers

91 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?

**0**

votes

**0**answers

49 views

### convexity of two linear spaces connected by convex nonlinear equality constraints

If there are two sets of linear constraints in different variables, Ax <= b with x_l <= x <= x_u and Cy <= d with y_l <= y <= y_u, and a set of equality constraints of a specific ...

**1**

vote

**1**answer

225 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

**1**answer

268 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 ...

**6**

votes

**2**answers

146 views

### On the convexity of element-wise norm 1 of the inverse

Question first asked on math.stackexchange here: http://math.stackexchange.com/questions/317209/on-the-convexity-of-element-wise-norm-1-of-the-inverse
On the convexity of element-wise norm 1 of the ...

**0**

votes

**1**answer

133 views

### Convex functions: bounding the difference

Suppose you are given a convex function $f: R^d \rightarrow R$. Let us say you are given $x,x' \in R^d$ and $x_1, x_2, \ldots, x_n \in R^d$ such that
$$\sum_{i=1}^n (x_i - x') = x - x'.$$
Is it ...

**0**

votes

**1**answer

101 views

### Is these two optimization problems share the same solution?

Hello all,
I am dealing with some SDP optimization, and I come across the following problem.
The optimization problem is given by
\begin{aligned}
&\operatorname*{min}_{t_1,\ldots,t_m,X}\ \sum ...

**1**

vote

**1**answer

269 views

### Question regard checking convexity by “restriction to any line that intersects the function domain”

Hello all,
I have a question (probably stupid one) about the fact that " A function is convex if and only if it is convex when restricted to any line that intersects its domain".
In Stephen Boyd and ...

**0**

votes

**1**answer

732 views

### Is a jointly convex function of x and y convex as a function of x when y=z(x)?

Hi,
Suppose that $x \in R^m, y \in R^n, z(x) \in R^n$, and $f(x,y)$ is convex in $(x,y)$.
Is $f(x,z(x))$ a convex function in $x$ for arbitrary continuous functions $z(x)$?
Thanks!

**2**

votes

**1**answer

306 views

### Proving that a specific function is quasiconvex

Hello all,
Assume we have a sequence of quasiconcave functions (in $X$) denoted by $f_{i,j}(X)$ for $i,j = 1,\ldots,n$. Denote by $F(X)$ the $n\times n$ matrix whose $(i,j)$ entry is the function ...

**2**

votes

**2**answers

398 views

### Does the minima of a sequence of convex convergent functions converge?

Suppose $f_1,f_2,\ldots $ is a sequence of convex functions that converges to a continuous convex $f$. Let $x_1^*,x_2^*$ be their respective (not necessarily unique) minima, and let y be a minima of ...

**2**

votes

**1**answer

1k views

### Sufficient conditions for gradient descent convergence

I have an unconstrained optimisation problem with convex objective function $f(x)$. Suppose I have access only to some function of the gradient $\hat{\nabla}= g(\nabla f)$, and I take gradient steps ...