The tag has no wiki summary.

learn more… | top users | synonyms

-1
votes
1answer
133 views

Regularized Gradient with respect to a matrix (with a specific structure)

Suppose we have a typical logdet function $\mathcal{L}$ $$ \mathcal{L} = \log\vert \mathbf{I} + \mathbf{A}\mathbf{S} \vert - \mathbf{q}^T(\mathbf{A}^{-1} + \mathbf{S})^{-1} \mathbf{q}, $$ where ...
0
votes
0answers
52 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 ...
2
votes
1answer
532 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
228 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) ...
1
vote
1answer
294 views

How does the complex convex set look like?

The usual convex set is the real linear convex set, if we change the real linear map into complex linear map, we can get the complex convex set. A system way to do this is in the several complex ...
0
votes
2answers
101 views

Feasibility of a given set of homogenuous nonconvex quadratic inequality constraints

Let $C_1$,$C_2$,...$C_N$ be $M \times M$ indefinite hermitian matrices. What can we say about the following quadratic constriants \begin{align} w^{H}C_1w>0 \\\ w^{H}C_2w>0 \\\ ...~~~~~~~~~~ \\\ ...
1
vote
0answers
92 views

Concavity of a ratio of Kullback-Leibler divergences

For $0\leq r\leq 1$ and $0 < p < 1$, define the Kullback-Leibler divergence between the Bernoulli(r) and Bernoulli(p) distributions as: $D(r||p) := r\log\frac{r}{p} + ...
3
votes
1answer
306 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 ...
1
vote
2answers
153 views

What is the dual of an semidefinitely representable (SDR) cone?

The Question Let $V\simeq \mathbb{R}^r$ be an $r$-dimensional vector space with the usual Euclidean inner product. Let $\mathcal K\subset V$ be a cone defined as $$ \mathcal K=\Big\{x\in ...
6
votes
2answers
152 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 ...
1
vote
0answers
134 views

Optimize a convex hull on a 2D histogram so the selected points match a target shape

I have an image (can be 2D or 3D), and compute a 2D histogram of the image (for example, the pixel intensity and gradient along certain direction). There is a known target region $R^*$ in the image. I ...
2
votes
1answer
414 views

existence of a minimum for a convex functional on a non-reflexive space

Let $X$ be a Banach space; $K\subset X$ nonempty, closed and convex; and $f:K\to \mathbb R$ lower semicontinuous, convex functional. Let also $f$ be coercive, i.e., $f(x)\to +\infty$ as $\|x\|\to ...
0
votes
1answer
147 views

Interpreting Set Notation on Theorem

In an article I am reading, they state a theorem from Victor Klee's "On Certain Intersection Properties of Convex Sets" and I am having trouble picturing this. The statement is: Let $C$ and $C_1, ...
1
vote
1answer
165 views

Are all points x of the boundary of a convex set C of a Hilbert space H projections onto C of a point different than x?

It appears that this is not true if H is of infinite dimension. My question is therefore the following: does anyone have a counter-example? Is there a caracterisation for the points of the boundary ...
5
votes
2answers
297 views

Efficient computation of “discrete infimal convolution”

This question arises from an application to graphical models in probability theory, but I have abstracted that part out so only algebra remains. Let $\mathbb{R}$ denote standard field of real numbers ...
4
votes
3answers
344 views

When is a sequentially closed cone, closed?

The following question I also posed here, but still got no answer. Let $X$ be a locally convex, Hausdorff topological vector space and $C\subseteq X$ a convex cone, which is sequentially closed. What ...
1
vote
2answers
134 views

determining a convex set by mixed volumes

For a convex set $K \subset \mathbb{R}^2$ let $\phi_K:$ convexsets in $\mathbb{R}^2 \rightarrow [0,\infty), A \mapsto MV(A,K)$. Where by $MV(A,K)$ I mean the mixed volume of $A$ and $K$ in the ...
1
vote
1answer
143 views

Subgradient of Minimum Eigenvalue

Consider three $N \times N$ Hermitian matrices $A_0$, $A_1$, $A_2$. Consider the function \begin{align} f(t_1,t_2)=\lambda_{\text{min}}(A_0+t_1A_1+t_2A_2) \end{align} where $\lambda_{\text{min}}$ ...
4
votes
1answer
424 views

Quantitative Version of Jensen's Inequality?

Hi, I've been looking at situations where Jensen's inequality is almost tight, and found myself proving a lemma that I'm nearly certain exists somewhere in the literature. The specifics are as ...
0
votes
1answer
142 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
1answer
133 views

Minimal point of the intersection of convex sets.

I am trying to find out if there is any known result in convex optimization that implies the following statement: "A minimal point of the intersection of $N > 2$ convex sets in $\mathbb{R}^2$ is ...
0
votes
1answer
170 views

A certain type of quadratic problem.

I am interested in solving the following equality constrained quadratic (?) problem. \begin{align} \min_{u^{H}u=1}~(u^{H}A_1u) \\\ s.t.~ u^{H}A_2u=0 \end{align} $A_1$ and $A_2$ are $N\times N$ ...
2
votes
2answers
257 views

A certain type of Quadratic Constrained Quadratic Programming Problem (QCQP)

Let $P_1$, $P_2$ be two hermitian matrices. Can anyone comment about the following (QCQP) \begin{equation} \min_{z}~z^{H}z \\\ ~~subject~to ~z^{H}P_1z+1\leq 0,~z^{H}P_2z+1\leq 0 \end{equation} I am ...
0
votes
2answers
322 views

Is minimum of convex envelope the same as minimum of the original function?

Hello everyone my question is: $Question:$ Consider a function $f:X \rightarrow \mathbf R$ where $X$ is a convex subset of $\mathbf{R}^n$. The convex envelope of $f$ over $X$ is defined as the ...
1
vote
0answers
402 views

Definition and Convergence of Iteratively Reweighted Least Squares

I've been using iteratively reweighted least squares (IRLS) to minimize functions of the following form, $J(m) = \sum_{i=1}^{N} \rho \left(\left| x_i - m \right|\right)$ where $N$ is the number of ...
0
votes
1answer
103 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
1answer
321 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
1answer
798 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
1answer
388 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
2answers
430 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 ...
3
votes
0answers
156 views

Ways to establish equality of measures on locally compact spaces

Let $M$ be a locally compact space and $\mu$ be some probability measure on $M$. Let $y^\ast \in M$, $f(x,y)$ be a real continuous bounded function $M \times M \to \mathbb{R}$. Consider an equality $$ ...
0
votes
0answers
148 views

On the remarkable property of the concave function's level sets

Consider a smooth function $f(x) \colon \mathbb{R}^2_+ \to \mathbb{R}_+$ such that $f$ is concave and positively homogeneous of order one. Consider a linear transform $P$ given by matrix $$ P = ...
2
votes
1answer
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 ...
2
votes
1answer
645 views

Projection exists => Uniformly convex?

Hello, I know that: Let X be a uniformly convex Banach-Space, $a\in X$ and $C\subset X$ closed and convex, then there is a unique $b\in C$ with $\left\Vert a-b\right\Vert=\inf_{x\in C}\left\Vert a-x ...
1
vote
0answers
130 views

variational problem under convexity constraints

I wonder if there is any method to compute variational problems subject to certain shape constraints (e.g., convexity, monotonicity, etc.). The literature I found on this topic (which I am no expert ...