AI Chat AI Image Generator AI Video Text to Speech

Low Rank Vectorized Hankel Lift for Matrix Recovery via Fast Iterative Hard Thresholding

09/23/2021

∙

by Zengying Zhu, et al.

∙

∙

We propose a VHL-FIHT algorithm for matrix recovery in blind super-resolution problems in a nonconvex schema. Under certain assumptions, we show that VHL-FIHT converges to the ground truth with linear convergence rate. Numerical experiments are conducted to validate the linear convergence and effectiveness of the proposed approach.

Zengying Zhu
2 publications
Jinchi Chen
8 publications
Weiguo Gao
17 publications

page 1

page 2

page 3

page 4

research

∙ 10/06/2021

Blind Super-resolution via Projected Gradient Descent

Blind super-resolution can be cast as low rank matrix recovery problem b...

0 Sihan Mao, et al. ∙

research

∙ 12/02/2021

Blind Super-resolution of Point Sources via Projected Gradient Descent

Blind super-resolution can be cast as a low rank matrix recovery problem...

0 Sihan Mao, et al. ∙

research

∙ 08/31/2020

Super-linear convergence in the p-adic QR-algorithm

The QR-algorithm is one of the most important algorithms in linear algeb...

0 Avinash Kulkarni, et al. ∙

research

∙ 03/02/2019

Matrix Completion via Nonconvex Regularization: Convergence of the Proximal Gradient Algorithm

Matrix completion has attracted much interest in the past decade in mach...

26 Fei Wen, et al. ∙

research

∙ 11/18/2013

Minimum n-Rank Approximation via Iterative Hard Thresholding

The problem of recovering a low n-rank tensor is an extension of sparse ...

0 Min Zhang, et al. ∙

research

∙ 04/02/2017

Provable Inductive Robust PCA via Iterative Hard Thresholding

The robust PCA problem, wherein, given an input data matrix that is the ...

0 U. N. Niranjan, et al. ∙

research

∙ 08/12/2020

Vectorized Hankel Lift: A Convex Approach for Blind Super-Resolution of Point Sources

We consider the problem of resolving r point sources from n samples at t...

0 Jinchi Chen, et al. ∙