The sparsity of underdetermined linear system via l_p minimization for 0 < p < 1
Summary: The sparsity problems have attracted a great deal of attention in recent years, which aim to find the sparsest solution of a representation or an equation. In the paper, we mainly study the sparsity of underdetermined linear system via \(l_p\) minimization for \(0 < p < 1\). We show, for a given underdetermined linear system of equations \(A_{m \times n} X = b\), that although it is not certain that the problem \((P_p)\) (i.e., \(\min_X \|X\|_p^p\) subject to \(A X = b\), where \(0 < p < 1\)) generates sparser solutions as the value of \(p\) decreases and especially the problem \((P_p)\) generates sparser solutions than the problem \((P_1)\) (i.e., \(\min_X \|X\|_1\) subject to \(A X = b\)), there exists a sparse constant \(\gamma(A, b) > 0\) such that the following conclusions hold when \(p < \gamma(A, b)\): (1) the problem \((P_p)\) generates sparser solution as the value of \(p\) decreases; (2) the sparsest optimal solution to the problem \((P_p)\) is unique under the sense of absolute value permutation; (3) let \(X_1\) and \(X_2\) be the sparsest optimal solution to the problems \((P_{p_1})\) and \((P_{p_2})(p_1 < p_2)\), respectively, and let \(X_1\) not be the absolute value permutation of \(X_2\). Then there exist \(t_1, t_2 \in [p_1, p_2]\) such that \(X_1\) is the sparsest optimal solution to the problem \((P_t)(\forall t \in [p_1, t_1])\) and \(X_2\) is the sparsest optimal solution to the problem \((P_t)\) (\(\forall t \in(t_2, p_2]\)).
- 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₁-Norm Solutions to Underdetermined Linear Systems
- Reweighted _1-minimization for sparse solutions to underdetermined linear systems
- Exact and approximate sparse solutions of underdetermined linear equations
- <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 _2-_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 and redundant representations. From theory to applications in signal and image processing.
- Sparse Approximate Solutions to Linear Systems
- 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\)
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Nonuniqueness of solutions of a class of \(\ell_0\)-minimization problems
- Sparse solutions to an underdetermined system of linear equations via penalized Huber loss
- Sparsest representations and approximations of an underdetermined linear system
- Least sparsity of \(p\)-norm based optimization problems with \(p>1\)
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Sparse solutions of a class of constrained optimization problems
- A note on the complexity of \(L _{p }\) minimization
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)
