$NP/CMP$ Equivalence: A Phenomenon Hidden Among Sparsity Models $l_{0}$ Minimization and $l_{p}$ Minimization for Information Processing
From MaRDI portal
Publication:2977388
DOI10.1109/TIT.2015.2429611zbMath1359.94152OpenAlexW2198498975WikidataQ57895361 ScholiaQ57895361MaRDI QIDQ2977388
Shi-Gang Yue, Ji-Gen Peng, 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
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Sampling theory in information and communication theory (94A20)
Related Items (9)
A theoretical result of sparse signal recovery via alternating projection method ⋮ 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 perspective of solving phaseless compressive sensing via its nonconvex relaxation ⋮ Sparse Solutions of a Class of Constrained Optimization Problems
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
