Some empirical advances in matrix completion

DOI10.1016/J.SIGPRO.2010.12.005zbMath1219.94068OpenAlexW2093238275MaRDI QIDQ548919

Rabab Kreidieh Ward, Angshul Majumdar

Publication date: 30 June 2011

Published in: Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.sigpro.2010.12.005

zbMATH Keywords

matrix completionnon-convex optimizationblue-noise sampling

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Sampling theory in information and communication theory (94A20)

Cites Work

• Fixed point and Bregman iterative methods for matrix rank minimization
• SVD-based joint azimuth/elevation estimation with automatic pairing
• Rank reduction and volume minimization approach to state-space subspace system identification
• Adaptive total variation image deblurring: a majorization-minimization approach
• Exact matrix completion via convex optimization
• A Singular Value Thresholding Algorithm for Matrix Completion
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• A Simpler Approach to Matrix Completion
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution

This page was built for publication: Some empirical advances in matrix completion