Some empirical advances in matrix completion
From MaRDI portal
Publication:548919
DOI10.1016/J.SIGPRO.2010.12.005zbMATH Open1219.94068OpenAlexW2093238275MaRDI QIDQ548919FDOQ548919
Authors: Angshul Majumdar, Rabab K. Ward
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
Recommendations
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Exact matrix completion via convex optimization
- A Singular Value Thresholding Algorithm for Matrix Completion
- Low-rank matrix completion by Riemannian optimization
- A graphical approach to the analysis of matrix completion
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Sampling theory in information and communication theory (94A20)
Cites Work
- A Singular Value Thresholding Algorithm for Matrix Completion
- Exact matrix completion via convex optimization
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Fixed point and Bregman iterative methods for matrix rank minimization
- A simpler approach to matrix completion
- Adaptive total variation image deblurring: a majorization-minimization approach
- SVD-based joint azimuth/elevation estimation with automatic pairing
- Rank reduction and volume minimization approach to state-space subspace system identification
Cited In (13)
- Matrix Completion From a Few Entries
- An adaptation for iterative structured matrix completion
- Adaptive and Implicit Regularization for Matrix Completion
- Multi-dimensional scaling from \(K\)-nearest neighbourhood distances
- Survey on matrix completion models and algorithms
- Matrix completion discriminant analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Matrix completion with sparse measurement errors
- 10.1162/153244304322765649
- MC2: a two-phase algorithm for leveraged matrix completion
- Exact matrix completion based on low rank Hankel structure in the Fourier domain
This page was built for publication: Some empirical advances in matrix completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q548919)