Smoothed sparse recovery via locally competitive algorithm and forward Euler discretization method

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

4 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)97-102
Journal / PublicationSignal Processing
Volume157
Online published26 Nov 2018
Publication statusPublished - Apr 2019

Abstract

This paper considers the problem of sparse recovery whose optimization cost function is a linear combination of a nonsmooth sparsity-inducing term and an ℓ2-norm as the metric for the residual error. Since the resultant sparse approximation involves nondifferentiable functions, locally competitive algorithm and forward Euler discretization method are exploited to approximate the nonsmooth objective function, yielding a smooth optimization problem. Alternating direction method of multipliers is then applied as the solver, and Nesterov acceleration trick is integrated for speeding up the computation process. Numerical simulations demonstrate the superiority of the proposed method over several popular sparse recovery schemes in terms of computational complexity and support recovery.

Research Area(s)

  • Alternating direction method of multipliers (ADMM), Locally competitive algorithm (LCA), Smoothed sparse recovery