Fast and provable algorithms for spectrally sparse signal reconstruction via low-rank Hankel matrix completion (Q1990969): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CVX / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2962694024 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1606.01567 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative hard thresholding for compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framelet-based image inpainting algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust recovery of complex exponential signals from random Gaussian projections via low rank Hankel matrix reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3071337 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed sensing with coherent and redundant dictionaries / 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: Wavelet Algorithms for High-Resolution Image Reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Spectral Compressed Sensing via Structured Matrix Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity to Basis Mismatch in Compressed Sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard Thresholding Pursuit: An Algorithm for Compressive Sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of fixed-point continuation algorithms for matrix rank minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: MUSIC for single-snapshot spectral estimation: stability and super-resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simpler Approach to Matrix Completion / 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: Compressed Sensing Off the Grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normalized Iterative Hard Thresholding for Matrix Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: User-friendly tail bounds for sums of random matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-Rank Matrix Completion by Riemannian Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guarantees of Riemannian Optimization for Low Rank Matrix Recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast symmetric SVD algorithm for square Hankel matrices / rank
 
Normal rank

Latest revision as of 02:46, 17 July 2024

scientific article
Language Label Description Also known as
English
Fast and provable algorithms for spectrally sparse signal reconstruction via low-rank Hankel matrix completion
scientific article

    Statements

    Fast and provable algorithms for spectrally sparse signal reconstruction via low-rank Hankel matrix completion (English)
    0 references
    0 references
    0 references
    0 references
    29 October 2018
    0 references
    spectrally sparse signal
    0 references
    low rank Hankel matrix completion
    0 references
    iterative hard thresholding
    0 references
    composite hard thresholding operator
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers