Recovery of Low-Rank Matrices Under Affine Constraints via a Smoothed Rank Function

DOI10.1109/TSP.2013.2295557zbMath1394.94363arXiv1308.2293MaRDI QIDQ4579014

Mohammadreza Malek-Mohammadi, Massoud Babaie-Zadeh, Arash A. Amini, Christian Jutten

Publication date: 22 August 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1308.2293

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (7)

Accelerated matrix completion algorithm using continuation strategy and randomized SVD ⋮ A new nonconvex approach to low-rank matrix completion with application to image inpainting ⋮ A penalty decomposition method for rank minimization problem with affine constraints ⋮ Strictly contractive Peaceman-Rachford splitting method to recover the corrupted low rank matrix ⋮ Matrix completion via minimizing an approximate rank ⋮ A modified primal-dual method with applications to some sparse recovery problems ⋮ An alternating direction method with continuation for nonconvex low rank minimization

This page was built for publication: Recovery of Low-Rank Matrices Under Affine Constraints via a Smoothed Rank Function