- Published 2015 in 2015 IEEE 6th International Workshop on…
DOI:10.1109/CAMSAP.2015.7383723

This note studies the problem of nonsymmetric rank-one matrix completion. We show that in every instance where the problem has a unique solution, one can recover the original matrix through the second round of the sum-of-squares/Lasserre hierarchy with minimization of the trace of the moments matrix. Our proof system is based on iteratively building a sum… (More)

### Presentations referencing similar topics