Pages that link to "Item:Q2689144"

The following pages link to Compressed sensing of low-rank plus sparse matrices (Q2689144):

Displaying 19 items.

• Strongly convex programming for exact matrix completion and robust principal component analysis (Q435847) (← links)
• Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset (Q518124) (← links)
• Painless breakups -- efficient demixing of low rank matrices (Q1710648) (← links)
• Linear program relaxation of sparse nonnegative recovery in compressive sensing microarrays (Q1929588) (← links)
• Compressed sensing and matrix completion with constant proportion of corruptions (Q1939501) (← links)
• Low-rank and sparse matrices fitting algorithm for low-rank representation (Q2004500) (← links)
• Sensitivity of low-rank matrix recovery (Q2100520) (← links)
• Robust recovery of low-rank matrices with non-orthogonal sparse decomposition from incomplete measurements (Q2662546) (← links)
• Analysis of Regularized LS Reconstruction and Random Matrix Ensembles in Compressed Sensing (Q2976934) (← links)
• Rate Optimal Denoising of Simultaneously Sparse and Low Rank Matrices (Q3188017) (← links)
• Low-Rank PSD Approximation in Input-Sparsity Time (Q4575882) (← links)
• Alternating Optimization of Sensing Matrix and Sparsifying Dictionary for Compressed Sensing (Q4580459) (← links)
• Binary Matrices for Compressed Sensing (Q4621516) (← links)
• Adaptive Matrix Design for Boosting Compressed Sensing (Q4956696) (← links)
• Compressive principal component pursuit (Q4982421) (← links)
• Quantization for low-rank matrix recovery (Q5242867) (← links)
• Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation (Q5281238) (← links)
• Compressed sensing of low-rank plus sparse matrices (Q6345368) (← links)
• A theory of optimal convex regularization for low-dimensional recovery (Q6663356) (← links)