Robust sparse recovery via weakly convex optimization in impulsive noise

Qi Liu*, Chengzhu Yang, Yuantao Gu, Hing Cheung So

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

24 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)84-89
Number of pages6
JournalSignal Processing
Volume152
DOIs
Publication statusPublished - Nov 2018
Externally publishedYes

Keywords

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

Fingerprint

Dive into the research topics of 'Robust sparse recovery via weakly convex optimization in impulsive noise'. Together they form a unique fingerprint.

Cite this