New low-rank optimization model and algorithms for spectral compressed sensing

Semidefinite programming (90C22) Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Sampling theory in information and communication theory (94A20) Matrix completion problems (15A83)

Cites Work

1-bit compressive sensing: reformulation and RRSP-based sign recovery theory
Super-resolution from noisy data
User-friendly tail bounds for sums of random matrices
Robust recovery of complex exponential signals from random Gaussian projections via low rank Hankel matrix reconstruction
MUSIC for single-snapshot spectral estimation: stability and super-resolution
Toeplitz and Hankel operators on the Paley-Wiener space
Factorization of finite rank Hankel and Toeplitz matrices
The convex geometry of linear inverse problems
Fast and provable algorithms for spectrally sparse signal reconstruction via low-rank Hankel matrix completion
Spectral compressive sensing
Spike detection from inaccurate samplings
Vandermonde Decomposition of Multilevel Toeplitz Matrices With Application to Multidimensional Super-Resolution
Robust Spectral Compressed Sensing via Structured Matrix Completion
Matrix pencil method for estimating parameters of exponentially damped/undamped sinusoids in noise
Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
Spectral Analysis of Signals: The Missing Data Case
Estimating two-dimensional frequencies by matrix enhancement and matrix pencil
SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
Atomic Norm Denoising With Applications to Line Spectral Estimation
A New Frequency Estimation Method for Equally and Unequally Spaced Data
On Gridless Sparse Methods for Line Spectral Estimation From Complete and Incomplete Data
Direction-of-Arrival Estimation for Coprime Array via Virtual Array Interpolation
An improved spatial smoothing technique for bearing estimation in a multipath environment
Forward/backward spatial smoothing techniques for coherent signal identification
Recovering Low-Rank Matrices From Few Coefficients in Any Basis
Compressed Sensing Off the Grid
Towards a Mathematical Theory of Super‐resolution
Maximum likelihood line spectral estimation in the signal domain: a rank-constrained structured matrix recovery approach

This page was built for publication: New low-rank optimization model and algorithms for spectral compressed sensing