2 citations · 3 across the 3 of their papers we have counts for
1 paper · 1 filter
Sebastian Krämer
The affine rank minimization (ARM) problem is well known for both its applications and the fact that it is NP-hard. One of the most successful approaches, yet arguably underreprese…