Efficient Algorithms on Robust Low-Rank Matrix Completion Against Outliers

DOI10.1109/TSP.2016.2572049MaRDI QIDQ4620927zbMATH OpenOpenAlexFDO

Authors Licheng Zhao, Prabhu Babu, D. P. Palomar

Publication date 8 February 2019

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

Full work available at URL https://doi.org/10.1109/tsp.2016.2572049

Mathematics Subject Classification ID

Matrix completion problems (15A83) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited in

(4)

• Efficient iteratively reweighted algorithms for robust hyperbolic localization
• Identifying Outliers in Large Matrices via Randomized Adaptive Compressive Sampling
• Low-Rank Matrix Recovery Via Robust Outlier Estimation
• Robust time-of-arrival localization via ADMM

This page was built for publication: Efficient Algorithms on Robust Low-Rank Matrix Completion Against Outliers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4620927)