The sampling complexity on nonconvex sparse phase retrieval problem
From MaRDI portal
Publication:6085637
DOI10.23952/jnva.7.2023.4.09OpenAlexW4384574983MaRDI QIDQ6085637
Publication date: 12 December 2023
Published in: Journal of Nonlinear and Variational Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.23952/jnva.7.2023.4.09
Cites Work
- Unnamed Item
- Solving quadratic equations via phaselift when there are about as many equations as unknowns
- Phase retrieval for sparse signals
- A strong restricted isometry property, with an application to phaseless compressed sensing
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Uniform uncertainty principle for Bernoulli and subgaussian ensembles
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- On signal reconstruction without phase
- An algebraic characterization of injectivity in phase retrieval
- The recovery of complex sparse signals from few phaseless measurements
- Adaptive iterative hard thresholding for low-rank matrix recovery and rank-one measurements
- PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming
- Phase Retrieval via Wirtinger Flow: Theory and Algorithms
- Restricted isometry properties and nonconvex compressive sensing
- An Introduction to Random Matrices
- Stirling's Series Made Easy
- Compressive Phase Retrieval via Generalized Approximate Message Passing
- Sparse Phase Retrieval via Truncated Amplitude Flow
- Sparse Phase Retrieval Via PhaseLiftOff
- Low-Rank Matrix Recovery With Scaled Subgradient Methods: Fast and Robust Convergence Without the Condition Number
- Sample-Efficient Algorithms for Recovering Structured Signals From Magnitude-Only Measurements
