Matrix Completion and Tensor Rank

arxiv: 1302.2639 · v2 · pith:5W4XY6WUnew · submitted 2013-02-11 · 🧮 math.OC · math.ST· stat.TH

Harm Derksen This is my paper

classification 🧮 math.OC math.STstat.TH

keywords rankcompletionmatrixproblemtensorcertainfindingreduced

0 comments

read the original abstract

In this paper, we show that the low rank matrix completion problem can be reduced to the problem of finding the rank of a certain tensor.

This paper has not been read by Pith yet.