Iterative Concave Rank Approximation for Recovering Low-Rank Matrices

DOI10.1109/TSP.2014.2340820zbMath1394.94364arXiv1504.01158OpenAlexW2005612613MaRDI QIDQ4579496

Massoud Babaie-Zadeh, Mohammadreza Malek-Mohammadi, Mikael Skoglund

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/1504.01158

Mathematics Subject Classification ID

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

Related Items (5)

Low-rank matrix recovery problem minimizing a new ratio of two norms approximating the rank function then using an ADMM-type solver with applications ⋮ A non-convex tensor rank approximation for tensor completion ⋮ Nonconvex and nonsmooth sparse optimization via adaptively iterative reweighted methods ⋮ Matrix completion via minimizing an approximate rank ⋮ Ellipse fitting via low-rank generalized multidimensional scaling matrix recovery

This page was built for publication: Iterative Concave Rank Approximation for Recovering Low-Rank Matrices