Blind Deconvolution Meets Blind Demixing: Algorithms and Performance Bounds
From MaRDI portal
Publication:5358585
DOI10.1109/TIT.2017.2701342zbMath1370.94583arXiv1512.07730OpenAlexW2962818938MaRDI QIDQ5358585
Publication date: 21 September 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.07730
Related Items (18)
The numerics of phase retrieval ⋮ Robust recovery of low-rank matrices with non-orthogonal sparse decomposition from incomplete measurements ⋮ Guarantees of Riemannian optimization for low rank matrix completion ⋮ Optimal Injectivity Conditions for Bilinear Inverse Problems with Applications to Identifiability of Deconvolution Problems ⋮ Convex and Nonconvex Optimization Are Both Minimax-Optimal for Noisy Blind Deconvolution Under Random Designs ⋮ Blind three dimensional deconvolution via convex optimization ⋮ Sparse blind deconvolution and demixing through \(\ell_{1,2}\)-minimization ⋮ Riemannian thresholding methods for row-sparse and low-rank matrix recovery ⋮ Painless breakups -- efficient demixing of low rank matrices ⋮ Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization ⋮ Exact matrix completion based on low rank Hankel structure in the Fourier domain ⋮ Sparse power factorization: balancing peakiness and sample complexity ⋮ Self-Calibration and Bilinear Inverse Problems via Linear Least Squares ⋮ Multi-target detection with application to cryo-electron microscopy ⋮ Rapid, robust, and reliable blind deconvolution via nonconvex optimization ⋮ Hierarchical compressed sensing ⋮ Proof methods for robust low-rank matrix recovery ⋮ Geometry and Symmetry in Short-and-Sparse Deconvolution
This page was built for publication: Blind Deconvolution Meets Blind Demixing: Algorithms and Performance Bounds
