NP/CMP Equivalence: A Phenomenon Hidden Among Sparsity Models l_{0} Minimization and l_{p} Minimization for Information Processing

DOI10.1109/TIT.2015.2429611MaRDI QIDQ2977388zbMATH OpenOpenAlexWikidataFDO

Authors Ji-Gen Peng, Shigang Yue, Hai-Yang Li

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2015.2429611

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Sampling theory in information and communication theory (94A20)

Cited in

(10)

• Analysis of the equivalence relationship between \(l_{0}\)-minimization and \(l_{p}\)-minimization
• Exact recovery of sparse multiple measurement vectors by \(l_{2,p}\)-minimization
• Affine matrix rank minimization problem via non-convex fraction function penalty
• Sparse recovery in probability via \(l_q\)-minimization with Weibull random matrices for \(0 < q\leq 1\)
• Single snapshot DOA estimation by minimizing the fraction function in sparse recovery
• The sparsest solution of the union of finite polytopes via its nonconvex relaxation
• A theoretical result of sparse signal recovery via alternating projection method
• Sparse solutions of a class of constrained optimization problems
• A new metric for the recoverability of sparse signals
• A theoretical perspective of solving phaseless compressive sensing via its nonconvex relaxation

This page was built for publication: $NP/CMP$ Equivalence: A Phenomenon Hidden Among Sparsity Models $l_{0}$ Minimization and $l_{p}$ Minimization for Information Processing

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