Hankel Low-Rank Matrix Completion: Performance of the Nuclear Norm Relaxation

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.

[1]  Emmanuel J. Candès,et al.  Matrix Completion With Noise , 2009, Proceedings of the IEEE.

[2]  Ivan Markovsky,et al.  The most powerful unfalsified model for data with missing values , 2016, Syst. Control. Lett..

[3]  Nicolas Gillis,et al.  Low-Rank Matrix Approximation with Weights or Missing Data Is NP-Hard , 2010, SIAM J. Matrix Anal. Appl..

[4]  Pierre Comon,et al.  Quasi-Hankel low-rank matrix completion: a convex relaxation , 2015, ArXiv.

[5]  Georg Heinig,et al.  Algebraic Methods for Toeplitz-like Matrices and Operators , 1984 .

[6]  David Day,et al.  Solving Complex-Valued Linear Systems via Equivalent Real Formulations , 2001, SIAM J. Sci. Comput..

[7]  Paul Tseng,et al.  Hankel Matrix Rank Minimization with Applications to System Identification and Realization , 2013, SIAM J. Matrix Anal. Appl..

[8]  N. Kreimer,et al.  Tensor completion based on nuclear norm minimization for 5D seismic data reconstruction , 2013 .

[9]  Ivan Markovsky,et al.  Structured Low-Rank Approximation with Missing Data , 2013, SIAM J. Matrix Anal. Appl..

[10]  G. Heinig,et al.  Parametrization of minimal rank block Hankel matrix extensions and minimal partial realizations , 1999 .

[11]  Pierre Comon,et al.  Symmetric tensor decomposition , 2009, 2009 17th European Signal Processing Conference.

[12]  G. Watson.  Characterization of the subdifferential of some matrix norms , 1992 .

[13]  F. A. Lootsma.  Distance Matrix Completion by Numerical Optimization , 1997 .

[14]  Leon Hirsch,et al.  Fundamentals Of Convex Analysis , 2016 .

[15]  Pablo A. Parrilo,et al.  Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization , 2007, SIAM Rev..

[16]  J. Gillard,et al.  Simple nuclear norm based algorithms for imputing missing data and forecasting in time series , 2017 .

[17]  David Gross,et al.  Recovering Low-Rank Matrices From Few Coefficients in Any Basis , 2009, IEEE Transactions on Information Theory.

[18]  Lieven Vandenberghe,et al.  Interior-Point Method for Nuclear Norm Approximation with Application to System Identification , 2009, SIAM J. Matrix Anal. Appl..

[19]  L. Hogben.  Matrix completion problems for pairs of related classes of matrices , 2003 .

[20]  Yuxin Chen,et al.  Robust Spectral Compressed Sensing via Structured Matrix Completion , 2013, IEEE Transactions on Information Theory.

[21]  Errol C. Caby.  An Introduction to Statistical Signal Processing , 2006, Technometrics.

[22]  Bernard Mourrain,et al.  A generalized flat extension theorem for moment matrices , 2009 .

[23]  Hugo J. Woerdeman,et al.  Minimal rank completions for block matrices , 1989 .

[24]  R. Bro.  PARAFAC. Tutorial and applications , 1997 .

[25]  Kristiaan Pelckmans,et al.  On the nuclear norm heuristic for a Hankel matrix completion problem , 2015, Autom..

[26]  Ivan Markovsky.  How Effective Is the Nuclear Norm Heuristic in Solving Data Approximation Problems , 2012 .

[27]  Emmanuel J. Candès,et al.  Exact Matrix Completion via Convex Optimization , 2008, Found. Comput. Math..

[28]  B. Schutter.  Minimal state-space realization in linear system theory: an overview , 2000 .

[29]  U. Grenander,et al.  Toeplitz Forms And Their Applications , 1958 .

[30]  O. Bosgra,et al.  On parametrizations for the minimal partial realization problem , 1983 .