An elementary proof of convex phase retrieval in the natural parameter space via the linear program PhaseMax

DOI10.4310/CMS.2018.V16.N7.A13zbMath1441.94040arXiv1611.03935OpenAlexW2573309900WikidataQ128246975 ScholiaQ128246975MaRDI QIDQ667019

Vladislav Voroninski, Paul E. Hand

Publication date: 12 March 2019

Published in: Communications in Mathematical Sciences (Search for Journal in Brave)

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

zbMATH Keywords

linear programmingphase retrievalPhaseMax

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Linear programming (90C05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (12)

The numerics of phase retrieval ⋮ Sparse signal recovery from phaseless measurements via hard thresholding pursuit ⋮ Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution ⋮ Provable sample-efficient sparse phase retrieval initialized by truncated power method ⋮ PhaseMax: Stable guarantees from noisy sub-Gaussian measurements ⋮ Phaseless sampling and reconstruction of real-valued signals in shift-invariant spaces ⋮ Solving equations of random convex functions via anchored regression ⋮ Riemannian optimization for phase retrieval from masked Fourier measurements ⋮ Unnamed Item ⋮ 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*

Uses Software

• PhaseMax
• PhaseLift
• Wirtinger Flow

This page was built for publication: An elementary proof of convex phase retrieval in the natural parameter space via the linear program PhaseMax