PhaseMax: Convex Phase Retrieval via Basis Pursuit

DOI10.1109/TIT.2018.2800768zbMath1390.94194arXiv1610.07531OpenAlexW2962941403MaRDI QIDQ4569212

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/1610.07531

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (39)

The numerics of phase retrieval ⋮ Sharp Restricted Isometry Bounds for the Inexistence of Spurious Local Minima in Nonconvex Matrix Recovery ⋮ Simultaneous Phase Retrieval and Blind Deconvolution via Convex Programming ⋮ Approximate message passing with spectral initialization for generalized linear models* ⋮ On the Convergence of Stochastic Primal-Dual Hybrid Gradient ⋮ Phase retrieval using alternating minimization in a batch setting ⋮ Sparse signal recovery from phaseless measurements via hard thresholding pursuit ⋮ On connections between amplitude flow and error reduction for phase retrieval and ptychography ⋮ 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 ⋮ Compressive phase retrieval: Optimal sample complexity with deep generative priors ⋮ Provable sample-efficient sparse phase retrieval initialized by truncated power method ⋮ Robust amplitude method with \(L_{1/2}\)-regularization for compressive phase retrieval ⋮ PhaseMax: Stable guarantees from noisy sub-Gaussian measurements ⋮ Complex phase retrieval from subgaussian measurements ⋮ Smoothed amplitude flow-based phase retrieval algorithm ⋮ Fast rank-one alternating minimization algorithm for phase retrieval ⋮ Estimation from nonlinear observations via convex programming with application to bilinear regression ⋮ A geometric analysis of phase retrieval ⋮ Total Variation--Based Phase Retrieval for Poisson Noise Removal ⋮ Phase retrieval with PhaseLift algorithm ⋮ Phase retrieval for sub-Gaussian measurements ⋮ A Laplacian approach to \(\ell_1\)-norm minimization ⋮ Conjugate phase retrieval in Paley-Wiener space ⋮ PhaseMax ⋮ Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence ⋮ Riemannian optimization for phase retrieval from masked Fourier measurements ⋮ BranchHull: convex bilinear inversion from the entrywise product of signals with known signs ⋮ Optimal combination of linear and spectral estimators for generalized linear models ⋮ A reweighted symmetric smoothed function approximating \(L_0\)-norm regularized sparse reconstruction method ⋮ Low-Rank Matrix Estimation from Rank-One Projections by Unlifted Convex Optimization ⋮ The Cramer–Rao lower bound in a non-AWGN model for the affine phase retrieval ⋮ Generalized approximate survey propagation for high-dimensional estimation ^* ⋮ Robust phase retrieval via median-truncated smoothed amplitude flow ⋮ A Spectral Estimation Framework for Phase Retrieval via Bregman Divergence Minimization ⋮ Compressed sensing in the spherical near-field to far-field transformation ⋮ Near-optimal bounds for signal recovery from blind phaseless periodic short-time Fourier transform ⋮ Sampling complexity on phase retrieval from masked Fourier measurements via Wirtinger flow* ⋮ Toward a Mathematical Theory of the Crystallographic Phase Retrieval Problem

This page was built for publication: PhaseMax: Convex Phase Retrieval via Basis Pursuit