On the Convex Geometry of Blind Deconvolution and Matrix Completion

DOI10.1002/cpa.21957OpenAlexW3097639623MaRDI QIDQ4995555

Felix Krahmer, Dominik Stöger

Publication date: 25 June 2021

Published in: Communications on Pure and Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

matrix completionlow-rank matrix recovery

Mathematics Subject Classification ID

Matrix completion problems (15A83) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Related Items

WARPd: A Linearly Convergent First-Order Primal-Dual Algorithm for Inverse Problems with Approximate Sharpness Conditions, On the robustness of noise-blind low-rank recovery from rank-one measurements, Riemannian thresholding methods for row-sparse and low-rank matrix recovery, Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data, Proof methods for robust low-rank matrix recovery