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: | Demanet, Laurent (Contributor), Zhang, Xiangxiong (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Mathematics (Contributor) |
Format: | Article |
Language: | English |
Published: |
2017-06-27T17:10:40Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
A parameterized Douglas-Rachford algorithm : theory and applications
by: Wang, Dongying
Published: (2017) -
Local and Global Analysis of Relaxed Douglas-Rachford for Nonconvex Feasibility Problems
by: Martins, Anna-Lena
Published: (2019) -
The Douglas–Rachford operator in the possibly inconsistent case : static properties and dynamic behaviour
by: Moursi, Walaa M.
Published: (2017) -
Robust classification with feature selection using an application of the Douglas-Rachford splitting algorithm
by: Barlaud Michel, et al.
Published: (2021-08-01) -
A short remark on the solution of Rachford-Rice equation
by: Lin Ling, et al.
Published: (2018-01-01)