Accelerating Ill-conditioned Hankel Matrix Recovery via Structured Newton-like Descent
arXiv:2406.07409 · doi:10.1088/1361-6420/adec13
Abstract
This paper studies the robust Hankel recovery problem, which simultaneously removes the sparse outliers and fulfills missing entries from the partial observation. We propose a novel non-convex algorithm, coined Hankel Structured Newton-Like Descent (HSNLD), to tackle the robust Hankel recovery problem. HSNLD is highly efficient with linear convergence, and its convergence rate is independent of the condition number of the underlying Hankel matrix. The recovery guarantee has been established under some mild conditions. Numerical experiments on both synthetic and real datasets show the superior performance of HSNLD against state-of-the-art algorithms.
References in corpus (9)
- Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals
- Rank-Sparsity Incoherence for Matrix Decomposition
- Robust Spectral Compressed Sensing via Structured Matrix Completion
- Structured Low-Rank Algorithms: Theory, MR Applications, and Links to Machine Learning
- Robust CUR Decomposition: Theory and Imaging Applications
- Laplacian Convolutional Representation for Traffic Time Series Imputation
- Accelerated Structured Alternating Projections for Robust Spectrally Sparse Signal Recovery
- Structured low-rank matrix completion for forecasting in time series analysis
- Structured Gradient Descent for Fast Robust Low-Rank Hankel Matrix Completion