Volkan Cevher, Christoph Koch, Anastasios Kyrillidis
Most learning methods with rank or sparsity constraints use convex relaxations, which lead to optimization with the nuclear norm or the`1-norm. However, several important learning applications cannot benet from this approach as they feature these convex no ...
JMLR W&CP2013