The sparsity of underdetermined linear system via \(l_p\) minimization for \(0 < p < 1\)

DOI10.1155/2015/584712zbMath1395.94134OpenAlexW1514552327WikidataQ57895542 ScholiaQ57895542MaRDI QIDQ1666063

Hai-yang Li, Shi-Gang Yue, Ji-Gen Peng

Publication date: 27 August 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2015/584712

Mathematics Subject Classification ID

Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cites Work

• Recovery of sparsest signals via \(\ell^q \)-minimization
• Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
• An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems
• Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
• Sparse recovery with pre-Gaussian random matrices
• Restricted isometry properties and nonconvex compressive sensing
• Sparse representations in unions of bases
• Sparse and Redundant Representations
• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
• <formula formulatype="inline"><tex Notation="TeX">$L_{1/2}$</tex> </formula> Regularization: Convergence of Iterative Half Thresholding Algorithm
• Sparse Approximate Solutions to Linear Systems
• Unnamed Item
• Unnamed Item

This page was built for publication: The sparsity of underdetermined linear system via \(l_p\) minimization for \(0 < p < 1\)