Blind Demixing and Deconvolution at Near-Optimal Rate

DOI10.1109/TIT.2017.2784481zbMath1390.94235arXiv1704.04178OpenAlexW2608011286MaRDI QIDQ4566661

Peter Jung, Felix Krahmer, Dominik Stöger

Publication date: 27 June 2018

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1704.04178

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Nonparametric estimation (62G05) Extreme value theory; extremal stochastic processes (60G70) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (10)

The numerics of phase retrieval ⋮ Robust recovery of low-rank matrices with non-orthogonal sparse decomposition from incomplete measurements ⋮ Convex and Nonconvex Optimization Are Both Minimax-Optimal for Noisy Blind Deconvolution Under Random Designs ⋮ Riemannian thresholding methods for row-sparse and low-rank matrix recovery ⋮ Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization ⋮ Reconstruction Methods in THz Single-Pixel Imaging ⋮ Exact matrix completion based on low rank Hankel structure in the Fourier domain ⋮ Sparse power factorization: balancing peakiness and sample complexity ⋮ Hyperbolic Wavelet Frames and Multiresolution in the Weighted Bergman Spaces ⋮ Proof methods for robust low-rank matrix recovery

This page was built for publication: Blind Demixing and Deconvolution at Near-Optimal Rate