Robust sparse recovery via weakly convex optimization in impulsive noise

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

13 Scopus Citations
View graph of relations


Related Research Unit(s)


Original languageEnglish
Pages (from-to)84-89
Journal / PublicationSignal Processing
Online published23 May 2018
Publication statusPublished - Nov 2018


We propose a robust sparse recovery formulation in impulsive noise, where ℓ1 norm as the metric for the residual error and a class of weakly convex functions for inducing sparsity are employed. To solve the corresponding nonconvex and nonsmooth minimization, a slack variable is introduced to guarantee the convexity of the equivalent optimization problem in each block of variables. An efficient algorithm is developed for minimizing the surrogate Lagrangian based on the alternating direction method of multipliers. Model analysis guarantees that this novel robust sparse recovery formulation guarantees to attain the global optimum. Compared with several state-of-the-art algorithms, our method attains better recovery performance in the presence of outliers.

Research Area(s)

  • ADMM, Global optimum, Robust sparse recovery, Weakly convex optimization