A theoretical perspective of solving phaseless compressive sensing via its nonconvex relaxation

DOI10.1016/J.INS.2017.06.020zbMATH Open1435.94098arXiv1702.00110OpenAlexW2964293393MaRDI QIDQ778434FDOQ778434

Authors: Guowei You, Yong Wang, Zhenghai Huang 

Publication date: 2 July 2020

Published in: Information Sciences (Search for Journal in Brave)

Abstract: As a natural extension of compressive sensing and the requirement of some practical problems, Phaseless Compressed Sensing (PCS) has been introduced and studied recently. Many theoretical results have been obtained for PCS with the aid of its convex relaxation. Motivated by successful applications of nonconvex relaxed methods for solving compressive sensing, in this paper, we try to investigate PCS via its nonconvex relaxation. Specifically, we relax PCS in the real context by the corresponding $el{l}_p$-minimization with $pin(0,1)$. We show that there exists a constant $p^{a}stin(0,1]$ such that for any fixed $pin(0,p^{a}st)$, every optimal solution to the $el{l}_p$-minimization also solves the concerned problem; and derive an expression of such a constant $p^{a}st$ by making use of the known data and the sparsity level of the concerned problem. These provide a theoretical basis for solving this class of problems via the corresponding $el{l}_p$-minimization.

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

Recommendations

• A flexible convex relaxation for phase retrieval
• Phase retrieval via Wirtinger flow: theory and algorithms
• On phaseless compressed sensing with partially known support
• Phaseless compressive sensing using partial support information
• Restricted isometry properties and nonconvex compressive sensing

zbMATH Keywords

compressive sensingphase retrieval\(\ell_p\)-minimizationphaseless compressive sensing

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Nonconvex programming, global optimization (90C26)

Cites Work

• Phaselift: exact and stable signal recovery from magnitude measurements via convex programming
• Phase retrieval via matrix completion
• Decoding by Linear Programming
• Convex Analysis
• Lectures on Polytopes
• Title not available (Why is that?)
• Sparse nonnegative solution of underdetermined linear equations by linear programming
• Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
• An unconstrained \(\ell_q\) minimization with \(0<q\leq 1\) for sparse solution of underdetermined linear systems
• Recovery of sparsest signals via \(\ell^q \)-minimization
• Sparse Approximate Solutions to Linear Systems
• Sparse representations in unions of bases
• Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$
• Exact Recovery Conditions for Sparse Representations With Partial Support Information
• Restricted $p$-Isometry Properties of Nonconvex Matrix Recovery
• Painless reconstruction from magnitudes of frame coefficients
• On signal reconstruction without phase
• Stable signal recovery from phaseless measurements
• Phase retrieval for sparse signals
• A strong restricted isometry property, with an application to phaseless compressed sensing
• Sparse solutions of linear complementarity problems
• Equivalence of minimal \(\ell _{0}\)- and \(\ell _{p }\)-norm solutions of linear equalities, inequalities and linear programs for sufficiently small \(p\)
• On the Performance of Sparse Recovery Via $\ell_p$-Minimization $(0 \leq p \leq 1)$
• A compressive sensing based privacy preserving outsourcing of image storage and identity authentication service in cloud
• $NP/CMP$ Equivalence: A Phenomenon Hidden Among Sparsity Models $l_{0}$ Minimization and $l_{p}$ Minimization for Information Processing
• Click Prediction for Web Image Reranking Using Multimodal Sparse Coding
• A smoothing method for sparse optimization over polyhedral sets

Cited In (7)

• Title not available (Why is that?)
• A theoretical result of sparse signal recovery via alternating projection method
• The sampling complexity on nonconvex sparse phase retrieval problem
• Stable recovery of weighted sparse signals from phaseless measurements via weighted l₁ minimization
• A non-convex regularization approach for compressive sensing
• On phaseless compressed sensing with partially known support
• The sparsest solution of the union of finite polytopes via its nonconvex relaxation

Uses Software

• PhaseLift

This page was built for publication: A theoretical perspective of solving phaseless compressive sensing via its nonconvex relaxation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q778434)