Exact matrix completion based on low rank Hankel structure in the Fourier domain

Abstract

Matrix completion is about recovering a matrix from its partial revealed entries, and it can often be achieved by exploiting the inherent simplicity or low dimensional structure of the target matrix. For instance, a typical notion of matrix simplicity is low rank. In this paper we study matrix completion based on another low dimensional structure, namely the low rank Hankel structure in the Fourier domain. It is shown that matrices with this structure can be exactly recovered by solving a convex optimization program provided the sampling complexity is nearly optimal. Empirical results are also presented to justify the effectiveness of the convex method.

References in corpus (7)

• A Simpler Approach to Matrix Completion
• An overview of low-rank matrix recovery from incomplete observations
• Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview
• Incoherence-Optimal Matrix Completion
• One condition for solution uniqueness and robustness of both l1-synthesis and l1-analysis minimizations
• The achievable performance of convex demixing
• Fast Cadzow's Algorithm and a Gradient Variant

Cited by in corpus (1)

• Fast Cadzow's Algorithm and a Gradient Variant