Hankel Low-Rank Matrix Completion: Performance of the Nuclear Norm Relaxation.
J. Sel. Topics Signal Processing(2016)
摘要
The completion of matrices with missing values under the rank constraint is a nonconvex optimization problem. A popular convex relaxation is based on minimization of the nuclear norm (sum of singular values) of the matrix. For this relaxation, an important question is whether the two optimization problems lead to the same solution. This question was addressed in the literature mostly in the case of random positions of missing elements and random known elements. In this contribution, we analyze the case of structured matrices with a fixed pattern of missing values, namely, the case of Hankel matrix completion. We extend existing results on completion of rank-one real Hankel matrices to completion of rank-r complex Hankel matrices.
更多查看译文
关键词
Hankel,matrix completion,nuclear norm
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络