Complex phase retrieval from subgaussian measurements
From MaRDI portal
Publication:2226993
DOI10.1007/s00041-020-09797-9zbMath1459.94038arXiv1906.08385OpenAlexW3101923424MaRDI QIDQ2226993
Publication date: 9 February 2021
Published in: The Journal of Fourier Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1906.08385
Point estimation (62F10) Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items (3)
The numerics of phase retrieval ⋮ Stable phase retrieval and perturbations of frames ⋮ Proof methods for robust low-rank matrix recovery
Uses Software
Cites Work
- Unnamed Item
- Improved recovery guarantees for phase retrieval from coded diffraction patterns
- Low rank matrix recovery from rank one measurements
- A mathematical introduction to compressive sensing
- Stable optimizationless recovery from phaseless linear measurements
- Solving quadratic equations via phaselift when there are about as many equations as unknowns
- Hanson-Wright inequality and sub-Gaussian concentration
- A flexible convex relaxation for phase retrieval
- A geometric analysis of phase retrieval
- The convex geometry of linear inverse problems
- Solving equations of random convex functions via anchored regression
- A partial derandomization of phaselift using spherical designs
- Fundamental limits of weak recovery with applications to phase retrieval
- Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval
- Phase retrieval: stability and recovery guarantees
- Phase retrieval from coded diffraction patterns
- Learning without Concentration
- Convex Recovery of a Structured Signal from Independent Random Linear Measurements
- PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming
- Absolute uniqueness of phase retrieval with random illumination
- Exact and Stable Covariance Estimation From Quadratic Sampling via Convex Programming
- Phase Retrieval via Wirtinger Flow: Theory and Algorithms
- Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems
- Bounding the Smallest Singular Value of a Random Matrix Without Concentration
- Phase Retrieval Without Small-Ball Probability Assumptions
- PhaseMax: Convex Phase Retrieval via Basis Pursuit
- Phase Retrieval Using Alternating Minimization
- Stable low-rank matrix recovery via null space properties
- High-Dimensional Probability
- On the Gap Between Restricted Isometry Properties and Sparse Recovery Conditions
- Phase transitions of spectral initialization for high-dimensional non-convex estimation
- Analysis of Spectral Methods for Phase Retrieval With Random Orthogonal Matrices
- Structured Signal Recovery From Quadratic Measurements: Breaking Sample Complexity Barriers via Nonconvex Optimization
- Optimal Spectral Initialization for Signal Recovery With Applications to Phase Retrieval
- Phase Retrieval With Random Gaussian Sensing Vectors by Alternating Projections
This page was built for publication: Complex phase retrieval from subgaussian measurements
