Recovery of high-dimensional sparse signals via \(\ell_1\)-minimization (Q364458): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59003488, #quickstatements; #temporary_batch_1712261475387
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The oracle inequalities on simultaneous Lasso and Dantzig selector in high-dimensional nonparametric regression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous analysis of Lasso and Dantzig selector / 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: The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder). / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable signal recovery from incomplete and inaccurate measurements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Just relax: convex programming methods for identifying sparse signals in noise / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decoding by Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recovery of Exact Sparse Representations in the Presence of Bounded Noise / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sparse Representations in Arbitrary Redundant Bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prox-Method with Rate of Convergence <i>O</i>(1/<i>t</i>) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncertainty principles and ideal atomic decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable recovery of sparse overcomplete representations in the presence of noise / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse representations in unions of bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Recovery of Sparse Signals Via $\ell _{1}$ Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further Results on Stable Recovery of Sparse Overcomplete Representations in the Presence of Noise / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable Recovery of Sparse Signals and an Oracle Inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shifting Inequality and Recovery of Sparse Signals / rank
 
Normal rank
Property / cites work
 
Property / cites work: For most large underdetermined systems of linear equations the minimal 𝓁<sub>1</sub>‐norm solution is also the sparsest solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Bounds for Restricted Isometry Constants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greed is Good: Algorithmic Results for Sparse Approximation / rank
 
Normal rank

Latest revision as of 21:10, 6 July 2024

scientific article
Language Label Description Also known as
English
Recovery of high-dimensional sparse signals via \(\ell_1\)-minimization
scientific article

    Statements

    Recovery of high-dimensional sparse signals via \(\ell_1\)-minimization (English)
    0 references
    0 references
    0 references
    9 September 2013
    0 references
    Summary: We consider the recovery of high-dimensional sparse signals via \(\ell_1\)-minimization under a mutual incoherence condition, which is shown to be sufficient for sparse signals recovery in the noiseless and noise cases. We study both \(\ell_1\)-minimization under the \(\ell_2\) constraint and the Dantzig selector. Using the two \(\ell_1\)-minimization methods and a technical inequality, some results are obtained. They improve the results of the error bounds in the literature and are extended to the general case of reconstructing an arbitrary signal.
    0 references
    0 references
    0 references

    Identifiers