On the Role of the Bounded Lemma in the SDP Formulation of Atomic Norm Problems

In problems involving the optimization of atomic norms, an upper bound on the dual atomic norm often arises as a constraint. For the special case of line spectral estimation, this upper bound on the dual atomic norm reduces to upper-bounding the magnitude response of a finite impulse response filter by a constant. It is well known that this can be rewritten as a semidefinite constraint, leading to an elegant semidefinite programming formulation of the atomic norm minimization problem. This result is a direct consequence of some classical results in system theory, well known for many decades. This is not detailed in the literature on atomic norms, quite understandably, because the emphasis therein is different. In fact, these connections can be found in the book by B. A. Dumitrescu, cited widely in the atomic norm literature. However, they are spread out among many different results and formulations. This letter makes the connection more clear by appealing to one simple result from system theory, thereby making it more transparent to wider audience.

[1]  Brian D. O. Anderson,et al.  Network Analysis and Synthesis: A Modern Systems Theory Approach , 2006 .

[2]  Jamal Tuqan,et al.  A state space approach to the design of globally optimal FIR energy compaction filters , 2000, IEEE Trans. Signal Process..

[3]  Gabriel Peyré,et al.  Exact Support Recovery for Sparse Spikes Deconvolution , 2013, Foundations of Computational Mathematics.

[4]  Emmanuel J. Cand Towards a Mathematical Theory of Super-Resolution , 2012 .

[5]  Emmanuel J. Candès,et al.  Super-Resolution from Noisy Data , 2012, Journal of Fourier Analysis and Applications.

[6]  Weiyu Xu,et al.  Precise semidefinite programming formulation of atomic norm minimization for recovering d-dimensional (D ≥ 2) off-the-grid frequencies , 2013, 2014 Information Theory and Applications Workshop (ITA).

[7]  Parikshit Shah,et al.  Compressed Sensing Off the Grid , 2012, IEEE Transactions on Information Theory.

[8]  PeyréGabriel,et al.  Exact Support Recovery for Sparse Spikes Deconvolution , 2015 .

[9]  Yuejie Chi,et al.  Off-the-Grid Line Spectrum Denoising and Estimation With Multiple Measurement Vectors , 2014, IEEE Transactions on Signal Processing.

[10]  Jian Li,et al.  Sparse Methods for Direction-of-Arrival Estimation , 2016, ArXiv.

[11]  F. Gamboa,et al.  Spike detection from inaccurate samplings , 2013, 1301.5873.

[12]  Pablo A. Parrilo,et al.  The Convex Geometry of Linear Inverse Problems , 2010, Foundations of Computational Mathematics.

[13]  Gongguo Tang,et al.  Near minimax line spectral estimation , 2013, 2013 47th Annual Conference on Information Sciences and Systems (CISS).

[14]  P. Vaidyanathan The discrete-time bounded-real lemma in digital filtering , 1985 .

[15]  Weiyu Xu,et al.  Spectral Super-Resolution With Prior Knowledge , 2014, IEEE Transactions on Signal Processing.

[16]  Lieven Vandenberghe,et al.  Semidefinite Representations of Gauge Functions for Structured Low-Rank Matrix Decomposition , 2016, SIAM J. Optim..

[17]  Benjamin Recht,et al.  Atomic norm denoising with applications to line spectral estimation , 2011, Allerton.

[18]  B. Dumitrescu Positive Trigonometric Polynomials and Signal Processing Applications , 2007 .

[19]  Yuejie Chi,et al.  Guaranteed Blind Sparse Spikes Deconvolution via Lifting and Convex Optimization , 2015, IEEE Journal of Selected Topics in Signal Processing.