2017
DOI: 10.1007/s00034-017-0498-5
|View full text |Cite
|
Sign up to set email alerts
|

A Primal Douglas–Rachford Splitting Method for the Constrained Minimization Problem in Compressive Sensing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 9 publications
(2 citation statements)
references
References 54 publications
0
2
0
Order By: Relevance
“…where || • || F stands for the Frobenius norm. In order to emphasize the sparsity of the output weights, the L 1 norm is used to design the regularizer, i.e., ψ(V ) = ||V || 1 (34) According to (33) and (34), we specify (32) as follows:…”
Section: A Extreme Learning Machinementioning
confidence: 99%
See 1 more Smart Citation
“…where || • || F stands for the Frobenius norm. In order to emphasize the sparsity of the output weights, the L 1 norm is used to design the regularizer, i.e., ψ(V ) = ||V || 1 (34) According to (33) and (34), we specify (32) as follows:…”
Section: A Extreme Learning Machinementioning
confidence: 99%
“…In recent years, the sparsity regularization method has evoked the advancement of the imaging method, leading to much improvement in the accuracy of reconstruction. The L 1 norm based regularization (L1R) method is the most popular, and researchers have developed many excellent algorithms to solve it, e.g., the split Bregman technique [25] and the ADMM [26]- [28], the FIST algorithm [29], the forwardbackward splitting algorithm [30], [31], the primal-dual algorithm [32], the Douglas-Rachford splitting method [33], etc. The above-mentioned methods behave differently to diverse application scenarios.…”
Section: Introductionmentioning
confidence: 99%