2 citations · 2 across the 1 of their papers we have counts for
1 paper · 1 filter
Andreas M. Tillmann, Rémi Gribonval, Marc E. Pfetsch
The computational complexity of a problem arising in the context of sparse optimization is considered, namely, the projection onto the set of k-cosparse vectors w.r.t. some given…