相关论文: The Minimum Rank Problem: a counterexample

We address the problem of minimizing a convex function over the space of large matrices with low rank. While this optimization problem is hard in general, we propose an efficient greedy algorithm and derive its formal approximation…

Minimization of the nuclear norm is often used as a surrogate, convex relaxation, for finding the minimum rank completion (recovery) of a partial matrix. The minimum nuclear norm problem can be solved as a trace minimization semidefinite…

In this paper, we introduce and study the notion of phase rank. Given a matrix filled with phases, i.e., with complex entries of modulus $1$, its phase rank is the smallest possible rank for a complex matrix with the same phase, but…

For the rank regularized minimization problem, we introduce several kinds of stationary points by the problem itself and its equivalent reformulations including the mathematical program with an equilibrium constraint (MPEC), the global…

The problem of low-rank matrix estimation recently received a lot of attention due to challenging applications. A lot of work has been done on rank-penalized methods and convex relaxation, both on the theoretical and applied sides. However,…

Optimization problems with rank constraints arise in many applications, including matrix regression, structured PCA, matrix completion and matrix decomposition problems. An attractive heuristic for solving such problems is to factorize the…

We study the rank of complex sparse matrices in which the supports of different columns have small intersections. The rank of these matrices, called design matrices, was the focus of a recent work by Barak et. al. (BDWY11) in which they…

The paper deals with the computation of the rank and the identifiability of a specific ternary form. Often, one knows some short Waring decomposition of a given form, and the problem is to determine whether the decomposition is minimal and…

We show that for several notions of rank including tensor rank, Waring rank, and generalized rank with respect to a projective variety, the maximum value of rank is at most twice the generic rank. We show that over the real numbers, the…

We present an example of a subfield $\mathcal{F}\subset\mathbb{R}$ and a matrix $A$ whose conventional and nonnegative ranks equal five, but the nonnegative rank with respect to $\mathcal{F}$ equals six. In other words, $A$ can be…

Let $\alpha $ be a $p \times q$ interval matrix with $p \geq q$ and with the endpoints of all its entries in the set of the rational numbers. We prove that, if $\alpha $ contains a rank-$r$ real matrix with $r \in \{2, q-2,q-1,q\}$, then it…

We consider the problem of recovering low-rank matrices from random rank-one measurements, which spans numerous applications including covariance sketching, phase retrieval, quantum state tomography, and learning shallow polynomial neural…

This preliminary note presents a heuristic for determining rank constrained solutions to linear matrix equations (LME). The method proposed here is based on minimizing a non-convex quadratic functional, which will hence-forth be termed as…

In this paper, we study the minimum rank among positive semidefinite matrices with a given graph of at most seven vertices (msr) by giving vector representations.

Subtracting a critical rank-one approximation from a matrix always results in a matrix with a lower rank. This is not true for tensors in general. Motivated by this, we ask the question: what is the closure of the set of those tensors for…

In this work, we focus on the high-dimensional trace regression model with a low-rank coefficient matrix. We establish a nearly optimal in-sample prediction risk bound for the rank-constrained least-squares estimator under no assumptions on…

It is well known that a best rank-$R$ approximation of order-3 tensors may not exist for $R\ge 2$. A best rank-$(R,R,R)$ approximation always exists, however, and is also a best rank-$R$ approximation when it has rank (at most) $R$. For…

We determine the rank of a random matrix A over a finite field with prescribed numbers of non-zero entries in each row and column. As an application we obtain a formula for the rate of low-density parity check codes. This formula verifies a…

Any counterexample to the two-dimensional Jacobian Conjecture gives a rational map from one projective plane to another. We use some ideas of the Minimal Model Program to study the combinatorial structure of a rational surface, that is…

Ranking a set of objects from the most dominant one to the least, based on the results of paired comparisons, proves to be useful in many contexts. Using the rankings of teams or individuals players in sports to seed tournaments is an…