Structured Signal Recovery From Quadratic Measurements: Breaking Sample Complexity Barriers via Nonconvex Optimization
From MaRDI portal
Publication:5223938
DOI10.1109/TIT.2019.2891653zbMath1431.94025arXiv1702.06175OpenAlexW2964073363WikidataQ128628435 ScholiaQ128628435MaRDI QIDQ5223938
Publication date: 19 July 2019
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.06175
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items (12)
Sparse signal recovery from phaseless measurements via hard thresholding pursuit ⋮ Fast and Reliable Parameter Estimation from Nonlinear Observations ⋮ Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution ⋮ Fundamental limits of weak recovery with applications to phase retrieval ⋮ A Generalization of Wirtinger Flow for Exact Interferometric Inversion ⋮ Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval ⋮ Compressive phase retrieval: Optimal sample complexity with deep generative priors ⋮ Riemannian thresholding methods for row-sparse and low-rank matrix recovery ⋮ Provable sample-efficient sparse phase retrieval initialized by truncated power method ⋮ Complex phase retrieval from subgaussian measurements ⋮ Sparse power factorization: balancing peakiness and sample complexity ⋮ Toward a Mathematical Theory of the Crystallographic Phase Retrieval Problem
This page was built for publication: Structured Signal Recovery From Quadratic Measurements: Breaking Sample Complexity Barriers via Nonconvex Optimization
