Accelerating Ill-conditioned Hankel Matrix Recovery via Structured Newton-like Descent

2024/06/11 by Cai, HanQin, Huang, Longxiu, Lu, Xiliang +1 · 2 citations
#15A29 #15A83 #47B35 #90C17 #90C26 #90C53 #FOS: Computer and information sciences #FOS: Electrical engineering #FOS: Mathematics #Information Theory (cs.IT) #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Optimization and Control (math.OC) #Signal Processing (eess.SP) #electronic engineering #information engineering

paper · doi:10.48550/arxiv.2406.07409

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.

Cited by

• Dynamical Sampling: A Survey
• Recovery Performance of PhaseLift for Phase Retrieval from Coded Diffraction Patterns

Related

• Simpler Gradient Methods for Blind Super-Resolution with Lower Iteration Complexity
• Blind Super-resolution via Projected Gradient Descent
• Low-rank matrix recovery with composite optimization: good conditioning\n and rapid convergence
• Exact matrix completion based on low rank Hankel structure in the Fourier domain
• A Unified Framework for Low-Rank plus Sparse Matrix Recovery