Alternating Strategies Are Good For Low-Rank Matrix Reconstruction
Preprint
Abstract
This article focuses on the problem of reconstructing low-rank matrices from underdetermined measurements using alternating optimization strategies. We endeavour to combine an alternating least-squares based estimation strategy with ideas from the alternating direction method of multipliers (ADMM) to recover structured low-rank matrices, such as Hankel structure. We show that merging these two alternating strategies leads to a better performance than the existing alternating least squares (ALS) strategy. The performance is evaluated via numerical simulations.Keywords
All Related Versions
This publication has 10 references indexed in Scilit:
- Reverberant Audio Source Separation via Sparse and Low-Rank ModelingIEEE Signal Processing Letters, 2014
- Hankel Matrix Rank Minimization with Applications to System Identification and RealizationSIAM Journal on Matrix Analysis and Applications, 2013
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithmMathematical Programming Computation, 2012
- Alternating Least-Squares for Low-Rank Matrix ReconstructionIEEE Signal Processing Letters, 2012
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of MultipliersFoundations and Trends in Machine Learning, 2011
- Lower Bounds on the Mean-Squared Error of Low-Rank Matrix ReconstructionIEEE Transactions on Signal Processing, 2011
- Tensor Versus Matrix Completion: A Comparison With Application to Spectral DataIEEE Signal Processing Letters, 2011
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm MinimizationSIAM Review, 2010
- Reduced rank linear regression and weighted low rank approximationsIEEE Transactions on Signal Processing, 2006
- Statistical Digital Signal Processing and ModelingTechnometrics, 1997