Pages that link to "Item:Q489110"

The following pages link to Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications (Q489110):

Displaying 15 items.

• 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory (Q341409) (← links)
• Optimality analysis on partial \(l_1\)-minimization recovery (Q683727) (← links)
• Uniqueness of the minimal \(l_1\)-norm solution to the monotone linear complementarity problem (Q1993073) (← links)
• Nonuniqueness of solutions of a class of \(\ell_0\)-minimization problems (Q2059197) (← links)
• The sparsest solution to the system of absolute value equations (Q2356345) (← links)
• Constructing New Weighted <i>ℓ</i>₁-Algorithms for the Sparsest Points of Polyhedral Sets (Q2976140) (← links)
• Solution uniqueness of convex piecewise affine functions based optimization with applications to constrained <i>ℓ</i>₁ minimization (Q5107961) (← links)
• Stability analysis of a class of sparse optimization problems (Q5135257) (← links)
• Weak Stability of <i>ℓ</i>₁-Minimization Methods in Sparse Data Reconstruction (Q5219713) (← links)
• Uniqueness Conditions for A Class of ℓ₀-Minimization Problems (Q5245836) (← links)
• A survey on compressive sensing: classical results and recent advancements (Q5855706) (← links)
• Nonnegative partial \(s\)-goodness for the equivalence of a 0-1 linear program to weighted linear programming (Q6173941) (← links)
• \(k\)-sparse vector recovery via truncated \(\ell_1 -\ell_2\) local minimization (Q6181376) (← links)
• k-Sparse Vector Recovery via $$\ell _1-\alpha \ell _2$$ Local Minimization (Q6493963) (← links)
• \(k\) block sparse vector recovery via block \(\ell_1-\ell_2\) minimization (Q6612074) (← links)