The sampling complexity on nonconvex sparse phase retrieval problem
From MaRDI portal
Recommendations
- Sampling complexity on phase retrieval from masked Fourier measurements via Wirtinger flow
- Sample-Efficient Low Rank Phase Retrieval
- Sparse Phase Retrieval: Uniqueness Guarantees and Recovery Algorithms
- Sparse phase retrieval via ℓp (0 < p ≤ 1) minimization
- Undersampled Sparse Phase Retrieval via Majorization–Minimization
- scientific article
- A theoretical perspective of solving phaseless compressive sensing via its nonconvex relaxation
- Misspecified nonconvex statistical optimization for sparse phase retrieval
- A sparsity-constrained sampling method with applications to communications and inverse scattering
- Sparse recovery by non-convex optimization - instance optimality
Cites work
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- A strong restricted isometry property, with an application to phaseless compressed sensing
- Adaptive iterative hard thresholding for low-rank matrix recovery and rank-one measurements
- An algebraic characterization of injectivity in phase retrieval
- An introduction to random matrices
- Compressive Phase Retrieval via Generalized Approximate Message Passing
- scientific article; zbMATH DE number 1433619 (Why is no real title available?)
- Low-Rank Matrix Recovery With Scaled Subgradient Methods: Fast and Robust Convergence Without the Condition Number
- On signal reconstruction without phase
- Phase retrieval for sparse signals
- Phase retrieval via Wirtinger flow: theory and algorithms
- Phaselift: exact and stable signal recovery from magnitude measurements via convex programming
- Restricted isometry properties and nonconvex compressive sensing
- Sample-Efficient Algorithms for Recovering Structured Signals From Magnitude-Only Measurements
- Solving quadratic equations via phaselift when there are about as many equations as unknowns
- Sparse Phase Retrieval Via PhaseLiftOff
- Sparse Phase Retrieval via Truncated Amplitude Flow
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Stirling's Series Made Easy
- The recovery of complex sparse signals from few phaseless measurements
- Uniform uncertainty principle for Bernoulli and subgaussian ensembles
This page was built for publication: The sampling complexity on nonconvex sparse phase retrieval problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6085637)
