The sparsity of underdetermined linear system via l_p minimization for 0 < p < 1
From MaRDI portal
Publication:1666063
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
Cites work
- <formula formulatype="inline"><tex Notation="TeX">$L_{1/2}$</tex> </formula> Regularization: Convergence of Iterative Half Thresholding Algorithm
- An unconstrained \(\ell_q\) minimization with \(0<q\leq 1\) for sparse solution of underdetermined linear systems
- Compressive sampling
- 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
- On sparse solutions of underdetermined linear systems
- Recovery of sparsest signals via \(\ell^q \)-minimization
- Restricted isometry properties and nonconvex compressive sensing
- Sparse Approximate Solutions to Linear Systems
- Sparse and redundant representations. From theory to applications in signal and image processing.
- Sparse recovery with pre-Gaussian random matrices
- Sparse representations in unions of bases
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
Cited in
(8)- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Sparsest representations and approximations of an underdetermined linear system
- A note on the complexity of \(L _{p }\) minimization
- Sparse solutions to an underdetermined system of linear equations via penalized Huber loss
- Nonuniqueness of solutions of a class of \(\ell_0\)-minimization problems
- 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 of a class of constrained optimization problems
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)
