DMCA
Just Relax: Convex Programming Methods for Identifying Sparse Signals in Noise (2006)
Cached
Download Links
| Citations: | 478 - 2 self |
BibTeX
@MISC{Tropp06justrelax:,
author = {Joel A. Tropp},
title = {Just Relax: Convex Programming Methods for Identifying Sparse Signals in Noise},
year = {2006}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This paper studies a difficult and fundamental problem that arises throughout electrical engineering, applied mathematics, and statistics. Suppose that one forms a short linear combination of elementary signals drawn from a large, fixed collection. Given an observation of the linear combination that has been contaminated with additive noise, the goal is to identify which elementary signals participated and to approximate their coefficients. Although many algorithms have been proposed, there is little theory which guarantees that these algorithms can accurately and efficiently solve the problem. This paper studies a method called convex relaxation, which attempts to recover the ideal sparse signal by solving a convex program. This approach is powerful because the optimization can be completed in polynomial time with standard scientific software. The paper provides general conditions which ensure that convex relaxation succeeds. As evidence of the broad impact of these results, the paper describes how convex relaxation can be used for several concrete signal recovery problems. It also describes applications to channel coding, linear regression, and numerical analysis.
Keyphrases
convex programming method identifying sparse signal convex relaxation elementary signal paper study short linear combination numerical analysis polynomial time fixed collection broad impact little theory convex program several concrete signal recovery problem linear combination many algorithm standard scientific software additive noise ideal sparse signal general condition linear regression fundamental problem electrical engineering
