PhaseMax: Convex Phase Retrieval via Basis Pursuit

DOI10.1109/TIT.2018.2800768MaRDI QIDQ4569212zbMATH OpenOpenAlexFDO

Authors Tom Goldstein, Christoph Studer

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

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

Abstract: We consider the recovery of a (real- or complex-valued) signal from magnitude-only measurements, known as phase retrieval. We formulate phase retrieval as a convex optimization problem, which we call PhaseMax. Unlike other convex methods that use semidefinite relaxation and lift the phase retrieval problem to a higher dimension, PhaseMax is a "non-lifting" relaxation that operates in the original signal dimension. We show that the dual problem to PhaseMax is Basis Pursuit, which implies that phase retrieval can be performed using algorithms initially designed for sparse signal recovery. We develop sharp lower bounds on the success probability of PhaseMax for a broad range of random measurement ensembles, and we analyze the impact of measurement noise on the solution accuracy. We use numerical results to demonstrate the accuracy of our recovery guarantees, and we showcase the efficacy and limits of PhaseMax in practice.

Cited in

(49)

• A geometric analysis of phase retrieval
• Fast rank-one alternating minimization algorithm for phase retrieval
• Estimation from nonlinear observations via convex programming with application to bilinear regression
• Phase retrieval with PhaseLift algorithm
• Phase retrieval for sub-Gaussian measurements
• A Laplacian approach to _1-norm minimization
• Conjugate phase retrieval in Paley-Wiener space
• Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence
• Riemannian optimization for phase retrieval from masked Fourier measurements
• Optimal combination of linear and spectral estimators for generalized linear models
• 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
• Phase retrieval using alternating minimization in a batch setting
• Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution
• Complex phase retrieval from subgaussian measurements
• Smoothed amplitude flow-based phase retrieval algorithm
• A reweighted symmetric smoothed function approximating L₀-norm regularized sparse reconstruction method
• Fundamental limits of weak recovery with applications to phase retrieval
• Sparse signal recovery from phaseless measurements via hard thresholding pursuit
• On connections between amplitude flow and error reduction for phase retrieval and ptychography
• Phaselift: exact and stable signal recovery from magnitude measurements via convex programming
• PhaseMax
• Phase Retrieval Using Feasible Point Pursuit: Algorithms and Cramér–Rao Bound
• Total variation-based phase retrieval for Poisson noise removal
• 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
• Toward a mathematical theory of the crystallographic phase retrieval problem
• Approximate message passing with spectral initialization for generalized linear models*
• On the convergence of stochastic primal-dual hybrid gradient
• Convolutional Phase Retrieval via Gradient Descent
• PhaseMax: stable guarantees from noisy sub-Gaussian measurements
• Sharp restricted isometry bounds for the inexistence of spurious local minima in nonconvex matrix recovery
• Simultaneous phase retrieval and blind deconvolution via convex programming
• 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
• Sampling complexity on phase retrieval from masked Fourier measurements via Wirtinger flow
• The numerics of 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
• ADMM based Fourier phase retrieval with untrained generative prior
• Stochastic algorithms with geometric step decay converge linearly on sharp functions
• Truncated amplitude flow with coded diffraction patterns
• An inverse source problem for the stochastic multiterm time-fractional diffusion-wave equation
• Unrolling deep learning end-to-end method for phase retrieval
• An inverse problem for the wave equation with a random source driven by a spatial fractional Brownian motion
• The condition number in phase retrieval from intensity measurements
• BranchHull: convex bilinear inversion from the entrywise product of signals with known signs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4569212)