This paper considers the problem of reconstructing low-rank matrices from undersampled measurements, when the matrix has a known linear structure. Based on the iterative reweighted least-squares approach, we develop an algorithm that exploits the linear structure in an efficient way that allows for reconstruction in highly undersampled scenarios. The method also enables inferring an appropriate regularization parameter value from the observations. The performance of the method is tested in a missing data recovery problem.QC 20130723</p
Abstract. We consider low-rank approximation of affinely structured matrices with missing elements. ...
Abstract Low-rank matrix approximation has applications in many fields, such as 3D reconstruction fr...
Abstract This paper proposes a proximal iteratively reweighted algorithm to recover a low-rank matri...
Abstract. We present and analyze an efficient implementation of an iteratively reweighted least squa...
A low-rank matrix can be recovered from a small number of its linear measurements. As a special case...
This work presents a general framework for solving the low rank and/or sparse matrix minimization pr...
This paper presents a general framework for solving the low-rank and/or sparse matrix minimization p...
Recovering arbitrarily corrupted low-rank matrices arises in computer vision applications, including...
In the field of computer vision, it is common to require operations on matrices with “missing data”,...
The approach of SIAM J. Matrix Anal. Appl., 26(4):1083–1099 for solving structured total least squar...
Low-rank matrix recovery (LRMR) has been becoming an increasingly popular technique for analyzing da...
Matrix sensing problems capitalize on the assumption that a data matrix of interest is low-rank or i...
Low-rank matrix recovery problems arise naturally as mathematical formulations of various inverse pr...
The problem of recovering a low-rank matrix consistent with noisy linear measurements is a fundament...
We consider low-rank approximation of affinely structured matrices with missing elements. The method...
Abstract. We consider low-rank approximation of affinely structured matrices with missing elements. ...
Abstract Low-rank matrix approximation has applications in many fields, such as 3D reconstruction fr...
Abstract This paper proposes a proximal iteratively reweighted algorithm to recover a low-rank matri...
Abstract. We present and analyze an efficient implementation of an iteratively reweighted least squa...
A low-rank matrix can be recovered from a small number of its linear measurements. As a special case...
This work presents a general framework for solving the low rank and/or sparse matrix minimization pr...
This paper presents a general framework for solving the low-rank and/or sparse matrix minimization p...
Recovering arbitrarily corrupted low-rank matrices arises in computer vision applications, including...
In the field of computer vision, it is common to require operations on matrices with “missing data”,...
The approach of SIAM J. Matrix Anal. Appl., 26(4):1083–1099 for solving structured total least squar...
Low-rank matrix recovery (LRMR) has been becoming an increasingly popular technique for analyzing da...
Matrix sensing problems capitalize on the assumption that a data matrix of interest is low-rank or i...
Low-rank matrix recovery problems arise naturally as mathematical formulations of various inverse pr...
The problem of recovering a low-rank matrix consistent with noisy linear measurements is a fundament...
We consider low-rank approximation of affinely structured matrices with missing elements. The method...
Abstract. We consider low-rank approximation of affinely structured matrices with missing elements. ...
Abstract Low-rank matrix approximation has applications in many fields, such as 3D reconstruction fr...
Abstract This paper proposes a proximal iteratively reweighted algorithm to recover a low-rank matri...