All Questions
80 questions
4
votes
1
answer
891
views
Basic result in semi-infinite linear programming
Consider a standard linear program of the form $$\textrm{minimize}_x~~~~ c^Tx~~~~ s.t. \\ Ax = b \\ x \geq 0$$ with $x\in \mathbb{R}^n$ and $A \in \mathbb{R}^{m \times n}$. It is well known that, if ...
4
votes
2
answers
720
views
Existence of a strictly convex function interpolating given gradients and values
I'm wondering where to find a proof and reference for the following facts, which I feel sure must be true.
(1) Suppose we are given a finite set of points in $\mathbb{R}^{d+1}$. For each point, we ...
3
votes
0
answers
87
views
Instances of c-concavity outside of optimal transport?
Let $X$ and $Y$ be metric spaces, and let $c:X\times Y\rightarrow \mathbb{R}$ be a nonnegative function which we refer to as a cost. For any $\phi:X\rightarrow \mathbb{R}$ and $\psi:Y\rightarrow \...
3
votes
1
answer
402
views
Concavity near the boundary of the distance function
I was reading the paper
Quelques remarques sur les problemes elliptiques quasilineaires du
second ordre, P. L. Lions, Journal d’Analyse Mathématique volume 45,
pages 234–254(1985)
and on page 251 he ...
3
votes
3
answers
244
views
Example of a (strictly) proper scoring rule on a general measurable space?
Most of the literature on scoring rules that I know of deals with discrete measurable spaces, but in this paper by Gneiting and Raferty a very general definition of a scoring rule is given. I don't ...
3
votes
2
answers
791
views
complexity of finding optimal matchings of given fixed size
It is known, that maximal matchings (i.e. matchings with the maximal number of edges) and optimal matchings (i.e. matchings for which the sum of edge weights is optimal) can be calculated in ...
3
votes
4
answers
4k
views
Existence of nonnegative solutions to an underdetermined system of linear equations
Similar questions have been asked elsewhere, but I think this is sufficiently different to warrant a new post. I have a particular matrix $A$ and would like to know when the system $Ax = 0$ has at ...
2
votes
2
answers
402
views
Is this a linear optimization problem? $Ax=0$, $A$ has $m$ rows and $n$ columns, $m \le n$, all entries of $x$ are non-negative
$Ax=0$, $A$ has $m$ rows and $n$ columns, $m \le n$, all entries of $x$ are non-negative.
What should $A$ satisfy to guarantee the equation set have only zero solution?
2
votes
1
answer
254
views
On the infimal convolution of two norms on $\mathbb R^n$
$\newcommand{\R}{\mathbb R}$For natural $n$, $a\in\R^n$, and real $t>0$, let
\begin{equation*}
K:=K_{n,t}(a):=\inf_{x\in\R^n}(\|a-x\|_2+t\|x\|_1),
\end{equation*}
\begin{equation*}
M:=M_{n,...
2
votes
1
answer
2k
views
Finding a point farthest away from $k$ points in a polygon
There are $k$ points placed inside a polygon and I am interested in finding a point inside the polygon (not necessarily on its boundary) who's minimum distance to any of the $k$ points is maximized.
...
2
votes
2
answers
2k
views
Hessian of function of covariance matrices
Suppose we have a typical logdet function $\mathcal{L}$ with respect to a covariance matrix $\mathbf{A}$,
$$
\mathcal{L}(\mathbf{A}) = \log\vert \mathbf{I} + \mathbf{A}\mathbf{S} \vert - \mathbf{q}^T(\...
2
votes
0
answers
60
views
Test probability distributions increasing in convex order on $\mathbb R^2$?
Two probability distributions $\mu, \nu$ on $\mathbb R^d$ are said to be increasing in convex order if
$$\int_{\mathbb R^d} |x|\mu(dx) + \int_{\mathbb R^d} |x|\nu(dx)<\infty$$
and
$$\int_{\mathbb R^...
2
votes
1
answer
309
views
Concavity of hypergeometric function ratio
I would like to show that the function,
$$
f(x) = \frac{{}_2\mathrm{F}_1\big(\frac{1}{2},\frac{1}{2};c+1\,;x\big)}{{}_2\mathrm{F}_1\big(\frac{1}{2},\frac{1}{2};c\,;x\big)}
$$
is concave for $0 < x &...
2
votes
1
answer
1k
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}}$ ...
2
votes
0
answers
140
views
Covering a space by cones
Let $X\subset\mathbb{R}^n$ be some connected and bounded $n$-dimensional manifold, e.g. a space homeomorphic to an open/closed ball with possibly some parts of it being removed.
I am interested in ...
2
votes
0
answers
138
views
Convexity of volume in terms of a deformation
In the context of convex optimization and mechanics, I am interested in the convexity of the potential energy $U$ of a pressure acting over some volume $V$ enclosed by a surface. Here pressure can be ...
2
votes
1
answer
137
views
Design constraint systems over the reals
This question is inspired by the discussion at this problem.
Suppose I have a design consisting of a finite point set $U$ of size $|U|=m_{\emptyset}$ and a family of $n$ subsets (sometimes called ...
1
vote
1
answer
72
views
Generalised Lebesgue transform continuous wrt. strict topology?
Let $X$ and $Y$ be $\sigma$-compact spaces, and $\mu$ [resp. $\nu$] be a regular Borel probability measure on $X$ [resp. $Y$].
For a bounded continuous $c:X\times Y\rightarrow\mathbb{R}$, consider the ...
1
vote
1
answer
151
views
Monotone likelihood ratio of densities based on power function
Given $p,\phi,\theta \in \mathbb{R}$ such that $p>2$ and $0 \le \phi,\theta\le \pi/2$ define the density function:
$$f(\phi;\theta) =
\mbox{$\Large\frac{1}{p B\big(\hspace{-1pt}\frac{3}{2},\frac{p+...
1
vote
2
answers
121
views
How to solve the optimization problem $\max_{\mathbf{w}}\sum_i\text{sign}(\mathbf{w}^T \mathbf{x}_i)$?
I am looking for an algorithm to solve the following optimization problem
$$\max_{\mathbf{w}}\sum_i\text{sign}(\mathbf{w}^T \mathbf{x}_i)$$
where $\mathbf{w}$ and each $\mathbf{x}_i\in\mathbb{R}^d$.
...
1
vote
0
answers
122
views
Does the convex-hull of a set contain zero (II)?
Let $(\lambda_1, \cdots , \lambda_d) \vdash k$ be a partition of $k$ of length $d$. Suppose we have $k$ non-zero vectors $\alpha^{(j)} = (\alpha^{(j)}_1, \cdots , \alpha^{(j)}_d) \in \mathbb{Z}^d$, ...
1
vote
0
answers
123
views
Generalization of concave envelope
Let $g:\mathbb R_+\to\mathbb R$ be a measurable function (which could be supposed to be bounded and Lipschitz if required). Let $\mathcal P$ be the collection of probability measures $\mu$ on $\mathbb ...
1
vote
1
answer
190
views
Proof of extended version of non-random "almost supermartingale"
In this question, a non-random version of "almost supermartingale" theorem is proved.
Here, I would like to extend/apply the non-random version to the slightly different situation. I wonder ...
1
vote
1
answer
197
views
Sufficient conditions for the boundary unit-normal vector field of a closed convex set to be Lipschitz continuous
This is followup to the following question: On the Lipschitz continuity of the unit-normal vector field of a polytope
Let $C$ be a (nonempty) closed convex subset of $\mathbb R^n$. Note that to every ...
1
vote
1
answer
350
views
How to prove the convexity of a simple function involving a ratio of two polygamma functions?
Let
\begin{equation*}
\Gamma(z)=\int_0^{\infty}t^{z-1}\textrm{e}^{-t}\textrm{d}t, \quad \Re(z)>0
\end{equation*}
and
$$
\psi(z)=[\ln\Gamma(z)]'=\frac{\Gamma'(z)}{\Gamma(z)}.
$$
In the literature, ...
1
vote
0
answers
244
views
Möbius function and polynomials
Let $\mu$ be the Möbius function. It is well known that $\sum_{n|k} \mu(n) = 0$ for $k>1$. What could be said about the polynomials $R_k = \sum_{n|k} \mu(n) x^n$ for $x \in [0,1]$? There does not ...
0
votes
4
answers
457
views
Confining a polytope to one side of an affine hyperplane
Judging whether one convex polytope is inside of another when both are expressed as a system of linear inequalities seems not to be an easy problem.
This answer on math.stackexchange.com claims the ...
0
votes
1
answer
93
views
Continuity of generalised Legendre transform
Let $X$ and $Y$ be $\sigma$-compact spaces, and $\mu$ [resp. $\nu$] be a regular Borel probability measure on $X$ [resp. $Y$].
For a bounded continuous $c:X\times Y\rightarrow\mathbb{R}$, we consider ...
0
votes
1
answer
294
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 ...
0
votes
1
answer
88
views
Is the mapping $F(a):= \arg\min_{x \in \mathbb R^n} \|x-a\|_2 + \|x\|_1$ non-expansive?
Fix $a \in \mathbb R^n$ and let $\|\cdot\|$ be any norm on $\mathbb R$ (e.g $\ell_1$ norm). For any $a \in \mathbb R^n$, it is clear that the function $f_a(x) := \|x-a\|_2 + \|x\|$ is strictly convex ...