A necessary and sufficient condition for sparse vector recovery via \(\ell_1-\ell_2\) minimization (Q2667049): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A new sufficient condition for sparse vector recovery via ℓ1 − ℓ2 local minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp RIP bound for sparse signal and low-rank matrix recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The restricted isometry property and its implications for compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decoding by Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iteratively reweighted least squares minimization for sparse recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Method for Finding Structured Sparse Solutions to Nonnegative Least Squares Problems with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on guaranteed sparse recovery via \(\ell_1\)-minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mathematical introduction to compressive sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Aspects of Constrained L 1-L 2 Minimization for Compressive Sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing sparse representation in a highly coherent dictionary based on difference of \(L_1\) and \(L_2\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse recovery by non-convex optimization - instance optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis approach to d. c. programming: Theory, algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: DC approximation approaches for sparse optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: DC programming and DCA: thirty years of developments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable recovery of sparse signals via \(\ell_p\)-minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Improved Bounds of Restricted Isometry Constant for Recovery via &lt;formula formulatype="inline"&gt;&lt;tex Notation="TeX"&gt;$\ell_{p}$&lt;/tex&gt; &lt;/formula&gt;-Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of $\ell_{1-2}$ for Compressed Sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal RIP bounds for sparse signals recovery via \(\ell_p\) minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bounds of restricted isometry constants for low rank matrices recovery / rank
 
Normal rank

Latest revision as of 06:46, 27 July 2024

scientific article
Language Label Description Also known as
English
A necessary and sufficient condition for sparse vector recovery via \(\ell_1-\ell_2\) minimization
scientific article

    Statements

    A necessary and sufficient condition for sparse vector recovery via \(\ell_1-\ell_2\) minimization (English)
    0 references
    0 references
    0 references
    23 November 2021
    0 references
    compressive sensing
    0 references
    \( \ell_1-\ell_2\) minimization
    0 references
    sparse vector
    0 references
    vector recovery
    0 references

    Identifiers