Pages that link to "Item:Q5358585"

The following pages link to Blind Deconvolution Meets Blind Demixing: Algorithms and Performance Bounds (Q5358585):

Displaying 12 items.

• Sparse blind deconvolution and demixing through \(\ell_{1,2}\)-minimization (Q1696370) (← links)
• Painless breakups -- efficient demixing of low rank matrices (Q1710648) (← links)
• Exact matrix completion based on low rank Hankel structure in the Fourier domain (Q1979919) (← links)
• Sparse power factorization: balancing peakiness and sample complexity (Q2000543) (← links)
• Hierarchical compressed sensing (Q2106467) (← links)
• Proof methods for robust low-rank matrix recovery (Q2106469) (← links)
• Guarantees of Riemannian optimization for low rank matrix completion (Q2176515) (← links)
• Blind three dimensional deconvolution via convex optimization (Q2192919) (← links)
• Rapid, robust, and reliable blind deconvolution via nonconvex optimization (Q2330939) (← links)
• Robust recovery of low-rank matrices with non-orthogonal sparse decomposition from incomplete measurements (Q2662546) (← links)
• Multi-target detection with application to cryo-electron microscopy (Q5197877) (← links)
• Riemannian thresholding methods for row-sparse and low-rank matrix recovery (Q6157448) (← links)