Skip to main content

All Questions

Filter by
Sorted by
Tagged with
11 votes
2 answers
425 views

Maximization of a cubic form over the $14$-dimensional sphere

For any integers $i$ and $j$ such as $1\le i<j\le6$, let $x_{ij}$ be a nonnegative real number. Is it true that, given the condition $$\sum_{1\le i<j\le6}x_{ij}^2=1,$$ the sum $$\sum_{1\le i<...
Iosif Pinelis's user avatar
2 votes
1 answer
754 views

On a combinatorial inequality

Is it true that \begin{gather} \min\left(\lambda_{\min}(M_{12}), \lambda_{\min}(M_{13}), \lambda_{\min}(M_{14}), \lambda_{\min}(M_{15}), \lambda_{\min}(M_{23}), \\ \lambda_{\min}(M_{24}), \lambda_{\...
Jasmine's user avatar
  • 178
1 vote
0 answers
161 views

On an optimization question

Suppose we have a square matrix $M=(1-z)A+zB$ where $A,B$ have integer entries from $\{0,1\}$ with $\det(A)+\det(B)=1$ and $\det(A),\det(B),per(A),per(B)\in\{0,1\}$ and we want to find $z\in[0,1]$ ...
Turbo's user avatar
  • 13.9k
1 vote
1 answer
169 views

Best projection on non-convex discrete set with two constraints

I want to compute the projection of a vector $\left( x\right) _{1\leq i,j\leq n}\in \lbrack 0,1]^{n\times n}$ on the following discrete set $$ S=\left\{ x\in \{0,1\}^{n\times n}:x_{i,j}+x_{j,i}\leq 1;\...
Goga's user avatar
  • 47
1 vote
0 answers
110 views

Minimising kurtosis (non-convex). Can I use algebraic geometry or alternate methods to show uniqueness of a particular solution?

I consider a weighted sum of $n$ identically-distributed correlated random variables. The weights in the sum, $w_i$ for $i=1, 2,...,n$, satisfy $w_i>=0$ and $\sum_{i=1}^{n}w_i=1$. I am ...
Brian's user avatar
  • 173
4 votes
0 answers
287 views

A conjecture about the barycenter of a polytope

Could someone help me with the following conjecture? Thanks a lot! Suppose I have a polytope $\Delta$ in $\mathbb R^n (n\geq 2)$ with coordinates $(x_1,x_2,\cdots,x_n)$ defined by linear ...
user42804's user avatar
  • 1,121
1 vote
1 answer
124 views

Finding $P$ points among $N$ to approximate a probability density function?

Let $f$ be a probability density function (positive such that $\int_{\mathbb{R}} f(x) \mathrm{d} x = 1$) and $X_0 = \{x_n\}_{1\leq n \leq N}$ be $N$ given real points. We also fix $1 \leq P \leq N$ ...
Goulifet's user avatar
  • 2,306
8 votes
1 answer
497 views

Higher dimensional scutoids?

The recent discovery of scutoids in biological structures is fascinating. Two scutoids are depicted below (from Scientists Have Discovered an Entirely New Shape, And It Was Hiding in Your Cells), each ...
Tom Copeland's user avatar
  • 10.5k
2 votes
1 answer
107 views

Does this simple non-convex problem involving discrete phase shifts have an exact solution?

Let the optimization problem be \begin{equation} \max_{\phi_n} \left|\sum_{n=1}^N e^{i\phi_n} a_n \right|, \end{equation} where $a_n\in\mathbb{C}$ and the optimization variables have discrete phase ...
mermeladeK's user avatar
27 votes
5 answers
2k views

Is the matrix $\left({2m\choose 2j-i}\right)_{i,j=1}^{2m-1}$ nonsingular?

Suppose we have a $(2m-1) \times (2m-1)$ matrix defined as follows: $$\left({2m\choose 2j-i}\right)_{i,j=1}^{2m-1}.$$ For example, if $m=3$, the matrix is $$\begin{pmatrix}6 & 20 & 6& 0 ...
user42804's user avatar
  • 1,121
11 votes
0 answers
291 views

$L_2$ minimizing makespan vs. $L_\infty$ minimizing makespan

There are $n$ positive real numbers. We partition these numbers into $m$ parts, the size of each part is the sum the numbers in this part. Maximum size of the parts is called a makespan of a partition....
kakia's user avatar
  • 399
1 vote
0 answers
131 views

Lower bound on the value $\textbf{1}^Tx$ such as $Ax\geq b$

The problem may be formulated as follows: We are given a set of $m$ positive numbers $\{b_1,...,b_m\}$ and a set of $n$ positive numbers $\{v_1,...,v_n\}$. We have $v_j\leq K$, $j=1,...,n$, for a ...
user2370336's user avatar
5 votes
0 answers
404 views

Find subset of collection of sets whose intersection has minimum average value

Let $a_1,\ldots,a_n>0$, and let $S_1,\ldots,S_d\subset\{1,\ldots,n\}$ (all non-empty). For any $I\subseteq\{1,\ldots,d\}$, define $S(I)=\bigcap_{i\in I} S_i$. Given some $1\leq s < d$, consider ...
martin's user avatar
  • 300
1 vote
0 answers
201 views

Optimization of a multilinear function over a product of hypersimplices

Let $P = \Delta_1 \times \cdots \times \Delta_N$ be the Cartesian product of $N$ hypersimplices. Let $f : P \to \mathbb{R}$ be a multilinear function of $N$ variables, ie $x_i \mapsto f(x_1, \ldots, ...
user66081's user avatar
  • 171
5 votes
1 answer
523 views

Finding sparsest solution of a linear system

I want to find the solution with most zero-components for the following problem: $Ax=b$ for $A\in \mathbb{R}^{k\times n}, b \in \mathbb{R}^{k},k<n$, where $x$ is real and has no additional ...
dhasson's user avatar
  • 183
14 votes
2 answers
963 views

Conjecture on maximum of symmetric combinatoric function

A curious symmetric function crossed my way in some quantum mechanics calculations, and I'm interested its maximum value (for which I do have a conjecture). (The question was first asked at math.SE, ...
Mario Krenn's user avatar
2 votes
0 answers
97 views

Techniques for proving that a set of constraints over the integers are inconsistent

I have a problem which boils down to showing that a set of constraints has no solutions. A simplified version of this constraint system would be the following system: $$ \left\{ \begin{array}{l} \...
Edvard Fagerholm's user avatar
1 vote
0 answers
266 views

Multiobjective semidefinite programming

Let $C$ be size $n \times n^{2}$. Let $B$ be size $2^{g(n)} \times n^{2}$ where $g(n) > n$. There is only one $\mathcal{1}$ per row of $C$ and remaining entries of $C$ are $\mathcal{0}$. $B$ is ...
user16007's user avatar
  • 800