Search

MiS Preprint Repository

We have decided to discontinue the publication of preprints on our preprint server as of 1 March 2024. The publication culture within mathematics has changed so much due to the rise of repositories such as ArXiV (www.arxiv.org) that we are encouraging all institute members to make their preprints available there. An institute's repository in its previous form is, therefore, unnecessary. The preprints published to date will remain available here, but we will not add any new preprints here.

MiS Preprint
4/2021

Riemannian thresholding methods for row-sparse and low-rank matrix recovery

Henrik Eisenmann, Felix Krahmer, Max Pfeffer and André Uschmajew

Abstract

In this paper, we present modifications of the iterative hard thresholding (IHT) method for recovery of jointly row-sparse and low-rank matrices. In particular a Riemannian version of IHT is considered which significantly reduces computational cost of the gradient projection in the case of rank-one measurement operators, which have concrete applications in blind deconvolution. Experimental results are reported that show near-optimal recovery for Gaussian and rank-one measurements, and that adaptive stepsizes give crucial improvement. A Riemannian proximal gradient method is derived for the special case of unknown sparsity.

Received:
03.03.21
Published:
03.03.21

Related publications

inJournal
2023 Journal Open Access
Henrik Eisenmann, Felix Krahmer, Max Pfeffer and André Uschmajew

Riemannian thresholding methods for row-sparse and low-rank matrix recovery

In: Numerical algorithms, 93 (2023) 2, pp. 669-693