Eventual linear convergence of the Douglas-Rachford iteration for basis pursuit
We provide a simple analysis of the Douglas-Rachford splitting algorithm in the context of ℓ[superscript 1] minimization with linear constraints, and quantify the asymptotic linear convergence rate in terms of principal angles between relevant vector spaces. In the compressed sensing setting, we sho...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
2017-06-27T17:10:40Z.
|
| Subjects: | |
| Online Access: | Get fulltext |