Robust Harmonic Retrieval via Block Successive Upper-Bound Minimization

DOI10.1109/TSP.2018.2875394MaRDI QIDQ4622518zbMATH OpenOpenAlexWikidataFDO

Authors Cheng Qian, Yunmei Shi, Lei Huang, H. C. So

Publication date 12 February 2019

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tsp.2018.2875394

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited in

(5)

• Interior-point methods in \(l_1\) optimal sparse representation algorithms for harmonic retrieval
• Hankel tensor-based model and \(L_1\)-Tucker decomposition-based frequency recovery method for harmonic retrieval problem
• Rooting-Based Harmonic Retrieval Using Multiple Shift-Invariances: The Complete and the Incomplete Sample Cases
• Accurate and Computationally Efficient Tensor-Based Subspace Approach for Multidimensional Harmonic Retrieval
• Harmonic retrieval in the presence of non-circular Gaussian multiplicative noise: Performance bounds

This page was built for publication: Robust Harmonic Retrieval via Block Successive Upper-Bound Minimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4622518)