EXACT LOW-RANK MATRIX RECOVERY VIA NONCONVEX SCHATTEN p-MINIMIZATION (Q2846490): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Nai-Hua Xiu / rank
Normal rank
 
Property / author
 
Property / author: Nai-Hua Xiu / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Bounds for Restricted Isometry Constants / 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: Robust principal component analysis? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact matrix completion via convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decoding by Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted isometry properties and nonconvex compressive sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed sensing and best 𝑘-term approximation / 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: Compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncertainty principles and ideal atomic decomposition / 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: Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the complexity of \(L _{p }\) minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse recovery by non-convex optimization - instance optimality / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:05, 6 July 2024

scientific article
Language Label Description Also known as
English
EXACT LOW-RANK MATRIX RECOVERY VIA NONCONVEX SCHATTEN p-MINIMIZATION
scientific article

    Statements

    EXACT LOW-RANK MATRIX RECOVERY VIA NONCONVEX SCHATTEN p-MINIMIZATION (English)
    0 references
    0 references
    0 references
    5 September 2013
    0 references
    low-rank matrix recovery
    0 references
    nonconvex Schatten \(p\)-minimization
    0 references
    RIP condition
    0 references
    0 references

    Identifiers