15 citations · 26 across the 13 of their papers we have counts for
Showing 2017 · math.OCShow all
2 papers · 2 filters
math.OC2017
A Non-Convex Relaxation for Fixed-Rank Approximation
Carl Olsson, Marcus Carlsson, Erik Bylow
This paper considers the problem of finding a low rank matrix from observations of linear combinations of its elements. It is well known that if the problem fulfills a restricted i…
math.OC2017★ 1 cited
Non-Convex Rank/Sparsity Regularization and Local Minima
Carl Olsson, Marcus Carlsson, Fredrik Andersson +1
This paper considers the problem of recovering either a low rank matrix or a sparse vector from observations of linear combinations of the vector or matrix elements. Recent methods…