Sparse solution of underdetermined linear equations via adaptively iterative thresholding

Finding the sparset solution of an underdetermined system of linear equations y=Ax has attracted considerable attention in recent years. Among a large number of algorithms, iterative thresholding algorithms are recognized as one of the most efficient and important classes of algorithms. This is main...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Signal processing Jg. 97; S. 152 - 161
Hauptverfasser: Zeng, Jinshan, Lin, Shaobo, Xu, Zongben
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Amsterdam Elsevier B.V 01.04.2014
Elsevier
Schlagworte:
Algorithms
Applied sciences
Coherence
Convergence
Detection, estimation, filtering, equalization, prediction
Deviation
Exact sciences and technology
Global convergence
Information, signal and communications theory
Iterative methods
Iterative thresholding algorithm
Linear equations
Mathematical analysis
Mathematical models
Signal and communications theory
Signal, noise
Sparse solution
Telecommunications and information theory
Underdetermined linear equations
Underdetermined linear equations
Iterative thresholding algorithm
Global convergence
Sparse solution
Linear equation
Threshold detection
Coherence
Signal processing
Iterative method
Algorithm
Computational complexity
Adaptive method
ISSN:0165-1684, 1872-7557
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Finding the sparset solution of an underdetermined system of linear equations y=Ax has attracted considerable attention in recent years. Among a large number of algorithms, iterative thresholding algorithms are recognized as one of the most efficient and important classes of algorithms. This is mainly due to their low computational complexities, especially for large scale applications. The aim of this paper is to provide guarantees on the global convergence of a wide class of iterative thresholding algorithms. Since the thresholds of the considered algorithms are set adaptively at each iteration, we call them adaptively iterative thresholding (AIT) algorithms. As the main result, we show that as long as A satisfies a certain coherence property, AIT algorithms can find the correct support set within finite iterations, and then converge to the original sparse solution exponentially fast once the correct support set has been identified. Meanwhile, we also demonstrate that AIT algorithms are robust to the algorithmic parameters. In addition, it should be pointed out that most of the existing iterative thresholding algorithms such as hard, soft, half and smoothly clipped absolute deviation (SCAD) algorithms are included in the class of AIT algorithms studied in this paper. •We provide the convergence analysis of a class of adaptively iterative thresholding (AIT) algorithms for sparse solution of underdetermined linear equations y=Ax.•AIT algorithm converges to the unique sparsest solution with a linearly asymptotic convergence rate under the assumption that A satisfies a certain coherence property.•AIT algorithm finds the correct support set within finite iterations.•Most of the commonly used iterative thresholding algorithms are included in the class of AIT algorithms studied in this paper.
Bibliographie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
ISSN:0165-1684
1872-7557
DOI:10.1016/j.sigpro.2013.10.031