Skip to Main content Skip to Navigation
Journal articles

Sparse Signal Recovery Using Iterative Proximal Projection

Abstract : —This paper is concerned with designing efficient algorithms for recovering sparse signals from noisy underdeter-mined measurements. More precisely, we consider minimization of a non-smooth and non-convex sparsity promoting function subject to an error constraint. To solve this problem, we use an alternating minimization penalty method, which ends up with an iterative proximal-projection approach. Furthermore, inspired by accelerated gradient schemes for solving convex problems, we equip the obtained algorithm with a so-called extrapolation step to boost its performance. Additionally, we prove its convergence to a critical point. Our extensive simulations on synthetic as well as real data verify that the proposed algorithm considerably outperforms some well-known and recently proposed algorithms.
Document type :
Journal articles
Complete list of metadatas

Cited literature [47 references]  Display  Hide  Download
Contributor : Christian Jutten <>
Submitted on : Tuesday, February 20, 2018 - 3:56:32 PM
Last modification on : Wednesday, October 7, 2020 - 11:36:12 AM
Long-term archiving on: : Monday, May 21, 2018 - 1:26:04 PM


Files produced by the author(s)




Fateme Ghayem, Mostafa Sadeghi, Massoud Babaie-Zadeh, Saikat Chatterjee, Mikael Skoglund, et al.. Sparse Signal Recovery Using Iterative Proximal Projection. IEEE Transactions on Signal Processing, Institute of Electrical and Electronics Engineers, 2018, 66 (4), pp.879 - 894. ⟨10.1109/TSP.2017.2778695⟩. ⟨hal-01707062⟩



Record views


Files downloads