Sparse recovery by means of nonnegative least squares

Simon Foucart; David Koslicki

doi:10.1109/LSP.2014.2307064

Sparse recovery by means of nonnegative least squares

Simon Foucart, David Koslicki

Research output: Contribution to journal › Article › peer-review

57 Scopus citations

Abstract

This letter demonstrates that sparse recovery can be achieved by an ℓ₁-minimization ersatz easily implemented using a conventional nonnegative least squares algorithm. A connection with orthogonal matching pursuit is also highlighted. The preliminary results call for more investigations on the potential of the method and on its relations to classical sparse recovery algorithms.

Original language	English (US)
Article number	6750023
Pages (from-to)	498-502
Number of pages	5
Journal	IEEE Signal Processing Letters
Volume	21
Issue number	4
DOIs	https://doi.org/10.1109/LSP.2014.2307064
State	Published - Apr 2014

All Science Journal Classification (ASJC) codes

Signal Processing
Electrical and Electronic Engineering
Applied Mathematics

Access to Document

10.1109/LSP.2014.2307064

Cite this

@article{b35beae6e10346bfb0e52c1309883ec5,

title = "Sparse recovery by means of nonnegative least squares",

abstract = "This letter demonstrates that sparse recovery can be achieved by an ℓ1-minimization ersatz easily implemented using a conventional nonnegative least squares algorithm. A connection with orthogonal matching pursuit is also highlighted. The preliminary results call for more investigations on the potential of the method and on its relations to classical sparse recovery algorithms.",

author = "Simon Foucart and David Koslicki",

year = "2014",

month = apr,

doi = "10.1109/LSP.2014.2307064",

language = "English (US)",

volume = "21",

pages = "498--502",

journal = "IEEE Signal Processing Letters",

issn = "1070-9908",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "4",

}

TY - JOUR

T1 - Sparse recovery by means of nonnegative least squares

AU - Foucart, Simon

AU - Koslicki, David

PY - 2014/4

Y1 - 2014/4

N2 - This letter demonstrates that sparse recovery can be achieved by an ℓ1-minimization ersatz easily implemented using a conventional nonnegative least squares algorithm. A connection with orthogonal matching pursuit is also highlighted. The preliminary results call for more investigations on the potential of the method and on its relations to classical sparse recovery algorithms.

AB - This letter demonstrates that sparse recovery can be achieved by an ℓ1-minimization ersatz easily implemented using a conventional nonnegative least squares algorithm. A connection with orthogonal matching pursuit is also highlighted. The preliminary results call for more investigations on the potential of the method and on its relations to classical sparse recovery algorithms.

UR - http://www.scopus.com/inward/record.url?scp=84896128271&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84896128271&partnerID=8YFLogxK

U2 - 10.1109/LSP.2014.2307064

DO - 10.1109/LSP.2014.2307064

M3 - Article

AN - SCOPUS:84896128271

SN - 1070-9908

VL - 21

SP - 498

EP - 502

JO - IEEE Signal Processing Letters

JF - IEEE Signal Processing Letters

IS - 4

M1 - 6750023

ER -

Sparse recovery by means of nonnegative least squares

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this