36 citations · 61 across the 23 of their papers we have counts for
Showing 2021 · math.OCShow all
2 papers · 2 filters
math.OC2021
A note on the optimal convergence rate of descent methods with fixed step sizes for smooth strongly convex functions
André Uschmajew, Bart Vandereycken
Based on a result by Taylor, Hendrickx, and Glineur (J. Optim. Theory Appl., 178(2):455--476, 2018) on the attainable convergence rate of gradient descent for smooth and strongly c…
math.OC2021
Riemannian thresholding methods for row-sparse and low-rank matrix recovery
Henrik Eisenmann, Felix Krahmer, Max Pfeffer +1
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…