Precise Semidefinite Programming Formulation of Atomic Norm Minimization for Recovering d-Dimensional ($d\geq 2$) Off-the-Grid Frequencies
Abstract
Recent research in off-the-grid compressed sensing (CS) has demonstrated that, under certain conditions, one can successfully recover a spectrally sparse signal from a few time-domain samples even though the dictionary is continuous. In particular, atomic norm minimization was proposed in \cite{tang2012csotg} to recover -dimensional spectrally sparse signal. However, in spite of existing research efforts \cite{chi2013compressive}, it was still an open problem how to formulate an equivalent positive semidefinite program for atomic norm minimization in recovering signals with -dimensional () off-the-grid frequencies. In this paper, we settle this problem by proposing equivalent semidefinite programming formulations of atomic norm minimization to recover signals with -dimensional () off-the-grid frequencies.
Keywords
Cite
@article{arxiv.1312.0485,
title = {Precise Semidefinite Programming Formulation of Atomic Norm Minimization for Recovering d-Dimensional ($d\geq 2$) Off-the-Grid Frequencies},
author = {Weiyu Xu and Jian-Feng Cai and Kumar Vijay Mishra and Myung Cho and Anton Kruger},
journal= {arXiv preprint arXiv:1312.0485},
year = {2013}
}
Comments
4 pages, double-column,1 Figure