A smoothing proximal gradient algorithm for matrix rank minimization problem

In this paper, we study the low-rank matrix minimization problem, where the loss function is convex but nonsmooth and the penalty term is defined by the cardinality function. We first introduce an exact continuous relaxation, that is, both problems have the same minimizers and the same optimal value...

Ausführliche Beschreibung