A compact formulation for the l21 mixed-norm minimization problem
Christian Steffens, Marius Pesavento, Marc E. Pfetsch
Abstract
We present an equivalent, compact reformulation of the ℓ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2,1</sub> mixed-norm minimization problem for joint sparse signal reconstruction from multiple measurement vectors (MMVs). The reformulation builds upon a compact parameterization, which models the row-norms of the sparse signal representation as parameters of interest, resulting in a significant reduction of the MMV problem size. Given the sparse vector of row-norms, the joint sparse signal can be computed from the MMVs in closed form. For the special case of uniform linear sampling, we present an extension of the compact formulation for gridless parameter estimation by means of semidefinite programming. Furthermore, we derive in this case from our compact problem formulation the exact equivalence between the ℓ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2,1</sub> mixed-norm minimization and the atomic-norm minimization.
BibTeX
@inproceedings{icassp2017_acompactformulat,
title = {A compact formulation for the l21 mixed-norm minimization problem},
author = {Christian Steffens and Marius Pesavento and Marc E. Pfetsch},
booktitle = {ICASSP 2017},
year = {2017}
}