• DocumentCode
    133634
  • Title

    Precise semidefinite programming formulation of atomic norm minimization for recovering d-dimensional (D ≥ 2) off-the-grid frequencies

  • Author

    Weiyu Xu ; Jian-Feng Cai ; Mishra, Kumar Vijay ; Myung Cho ; Kruger, A.

  • Author_Institution
    Univ. of Iowa, Iowa City, IA, USA
  • fYear
    2014
  • fDate
    9-14 Feb. 2014
  • Firstpage
    1
  • Lastpage
    4
  • 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 [1] to recover 1-dimensional spectrally sparse signal. However, in spite of existing research efforts [2], it was still an open problem how to formulate an equivalent positive semidefinite program for atomic norm minimization in recovering signals with d-dimensional (d ≥ 2) 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 d-dimensional (d ≥ 2) off-the-grid frequencies.
  • Keywords
    compressed sensing; mathematical programming; minimisation; 1D spectrally sparse signal; CS; atomic norm minimization; d-dimensional off-the-grid frequencies; dictionary; equivalent positive semidefinite program; off-the-grid compressed sensing; precise semidefinite programming formulation; time-domain samples; Atomic clocks; Compressed sensing; Dictionaries; Matrix decomposition; Minimization; Polynomials; Programming; compressed sensing; matrix completion; spectral estimation; sum of squares;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory and Applications Workshop (ITA), 2014
  • Conference_Location
    San Diego, CA
  • Type

    conf

  • DOI
    10.1109/ITA.2014.6804267
  • Filename
    6804267