Structured Gradient Descent for Fast Robust Low-Rank Hankel Matrix Completion
Authors:
- 8 June 2023
- journal article
- research article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 45 (3) , A1172-A1198
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- HKRGC GRF (16309518, 16309219, 16310620, 16306821)
- National Science Foundation (DMS 2304489)
This publication has 28 references indexed in Scilit:
- Accelerated NMR Spectroscopy with Low‐Rank ReconstructionAngewandte Chemie International Edition, 2014
- Robust Spectral Compressed Sensing via Structured Matrix CompletionIEEE Transactions on Information Theory, 2014
- User-Friendly Tail Bounds for Sums of Random MatricesFoundations of Computational Mathematics, 2011
- Fast Multidimensional NMR Spectroscopy Using Compressed SensingAngewandte Chemie International Edition, 2011
- Robust principal component analysis?Journal of the ACM, 2011
- Simultaneous seismic data denoising and reconstruction via multichannel singular spectrum analysisGeophysics, 2011
- Rank-Sparsity Incoherence for Matrix DecompositionSIAM Journal on Optimization, 2011
- Exact Matrix Completion via Convex OptimizationFoundations of Computational Mathematics, 2009
- Baseline Correction for NMR Spectroscopic Metabolomics Data AnalysisBMC Bioinformatics, 2008
- Signal enhancement-a composite property mapping algorithmIEEE Transactions on Acoustics, Speech, and Signal Processing, 1988