A compact formulation for the l21 mixed-norm minimization problem.

Christian Steffens Marius Pesavento Marc E. Pfetsch

Published in: ICASSP (2017)

Keyphrases

norm minimization
convex optimization
convex relaxation
sparse representation
interior point methods
matrix completion
sparse coding
unsupervised feature selection
semidefinite programming
low rank
image classification
primal dual
object recognition
quadratic programming