A theoretical perspective of solving phaseless compressive sensing via its nonconvex relaxation
From MaRDI portal
Publication:778434
DOI10.1016/j.ins.2017.06.020zbMath1435.94098arXiv1702.00110OpenAlexW2964293393MaRDI QIDQ778434
Guowei You, Yong Wang, Zheng-Hai Huang
Publication date: 2 July 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.00110
Nonconvex programming, global optimization (90C26) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items
A theoretical result of sparse signal recovery via alternating projection method ⋮ On phaseless compressed sensing with partially known support ⋮ Stable recovery of weighted sparse signals from phaseless measurements via weighted l1 minimization ⋮ The sparsest solution of the union of finite polytopes via its nonconvex relaxation
Uses Software
Cites Work
- Unnamed Item
- Stable signal recovery from phaseless measurements
- Sparse solutions of linear complementarity problems
- Recovery of sparsest signals via \(\ell^q \)-minimization
- Equivalence of minimal \(\ell _{0}\)- and \(\ell _{p }\)-norm solutions of linear equalities, inequalities and linear programs for sufficiently small \(p\)
- 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\)
- Painless reconstruction from magnitudes of frame coefficients
- A compressive sensing based privacy preserving outsourcing of image storage and identity authentication service in cloud
- On signal reconstruction without phase
- PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming
- $NP/CMP$ Equivalence: A Phenomenon Hidden Among Sparsity Models $l_{0}$ Minimization and $l_{p}$ Minimization for Information Processing
- An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems
- Decoding by Linear Programming
- Sparse representations in unions of bases
- Lectures on Polytopes
- Click Prediction for Web Image Reranking Using Multimodal Sparse Coding
- Sparse Approximate Solutions to Linear Systems
- Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$
- On the Performance of Sparse Recovery Via $\ell_p$-Minimization $(0 \leq p \leq 1)$
- Exact Recovery Conditions for Sparse Representations With Partial Support Information
- Restricted $p$-Isometry Properties of Nonconvex Matrix Recovery
- A Smoothing Method for Sparse Optimization over Polyhedral Sets
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- Convex Analysis
- Phase Retrieval via Matrix Completion
