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

DOI10.1155/2015/584712zbMATH Open1395.94134OpenAlexW1514552327WikidataQ57895542 ScholiaQ57895542MaRDI QIDQ1666063FDOQ1666063

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

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

Recommendations

• Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
• On sparse solutions of underdetermined linear systems
• Sparsest representations and approximations of an underdetermined linear system
• An unconstrained \(\ell_q\) minimization with \(0<q\leq 1\) for sparse solution of underdetermined linear systems
• Sparse Solutions of Underdetermined Linear Systems and Their Applications
• Sparse solutions of underdetermined linear systems
• On the Error of Estimating the Sparsest Solution of Underdetermined Linear Systems
• RSP-Based Analysis for Sparsest and Least $\ell_1$-Norm Solutions to Underdetermined Linear Systems
• Reweighted \(\ell_1\)-minimization for sparse solutions to underdetermined linear systems
• Exact and approximate sparse solutions of underdetermined linear equations

Mathematics Subject Classification ID

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

Cites Work

• Compressive sampling
• Sparse and redundant representations. From theory to applications in signal and image processing.
• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
• Lower bound theory of nonzero entries in solutions of \(\ell_2-\ell_p\) minimization
• 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
• Restricted isometry properties and nonconvex compressive sensing
• Recovery of sparsest signals via \(\ell^q \)-minimization
• Sparse Approximate Solutions to Linear Systems
• Sparse representations in unions of bases
• <formula formulatype="inline"><tex Notation="TeX">$L_{1/2}$</tex> </formula> Regularization: Convergence of Iterative Half Thresholding Algorithm
• Sparse recovery with pre-Gaussian random matrices
• On sparse solutions of underdetermined linear systems

Cited In (8)

• Nonuniqueness of solutions of a class of \(\ell_0\)-minimization problems
• Sparsest representations and approximations of an underdetermined linear system
• A note on the complexity of \(L _{p }\) minimization
• Least sparsity of \(p\)-norm based optimization problems with \(p>1\)
• Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
• Sparse solutions to an underdetermined system of linear equations via penalized Huber loss
• Sparse solutions of a class of constrained optimization problems
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution

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

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