Simultaneous Phase Retrieval and Blind Deconvolution via Convex Programming

zbMath1455.94044arXiv1904.12680MaRDI QIDQ5214251

No author found.

Publication date: 7 February 2020

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

zbMATH Keywords

convexblind deconvolutionphase retrievalhyperbolic constraints

Mathematics Subject Classification ID

Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38) Convolution, factorization for one variable harmonic analysis (42A85)

Related Items

Reconstruction Methods in THz Single-Pixel Imaging

Uses Software

• minFunc
• PhaseMax
• PhaseLift
• BranchHull

Cites Work

• Unnamed Item
• The Bernstein-Orlicz norm and deviation inequalities
• Probability in Banach spaces. Isoperimetry and processes
• BranchHull: convex bilinear inversion from the entrywise product of signals with known signs
• A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
• A flexible convex relaxation for phase retrieval
• Regularization and the small-ball method. I: Sparse recovery
• Weak convergence and empirical processes. With applications to statistics
• Solving equations of random convex functions via anchored regression
• Local minima and convergence in low-rank semidefinite programming
• Phase retrieval from coded diffraction patterns
• Convex Recovery of a Structured Signal from Independent Random Linear Measurements
• PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming
• Blind Deconvolution Using Convex Programming
• Bounding the Smallest Singular Value of a Random Matrix Without Concentration
• PhaseMax: Convex Phase Retrieval via Basis Pursuit
• Regularization and the small-ball method II: complexity dependent error rates
• Geometry and Symmetry in Short-and-Sparse Deconvolution
• Benchmark Problems for Phase Retrieval
• Phase Retrieval via Matrix Completion