6 problems

Failure conjecture. Even if the slra code could tackle such a large input, its approach is likely to fail on this example.

Let $\textbf{P. 13}$ denote the optimization problem based on the distribution of $\bm{F}^{\rm{H}}\bm{\widehat H}^{\rm{H}}\bm{R}_{\bm{v}}^{-1}\bm{\widehat H}\bm{F}$, let…

Let $m,n$ and $e\leq mn$ be given, together with functions $g_i:\{0,1,\dots,n\}\rightarrow\mathbb{Z}$ for $i\in[m]$ and $f_j:\{0,1,\dots,m\}\rightarrow\mathbb{Z}$ for $j\in[n]$. Fo…

Nemirovski's conjecture. Whenever $t=O\big[\sqrt{\ln(M+N)}\big]$, there are absolute constants $\theta_1$ and $\theta_2$ such that

Let $A$ be a matrix, let $M$ and $N$ be row and column index sets, and let $p=\min(|M|,|N|)$. After optimizing the rank-one approximation variables, define … where…

Let $A$ be a nonnegative matrix, let $M$ and $N$ be row and column index sets, and define … where $\gamma$ is a penalty parameter, $\mathbf{u}$ and $\mathbf{v}$ are vectors, and…