2022
DOI: 10.1016/j.aml.2021.107717
|View full text |Cite
|
Sign up to set email alerts
|

A linearly convergent algorithm without prior knowledge of operator norms for solving 12 minimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 22 publications
0
2
0
Order By: Relevance
“…This is a typical 2 − 1 denoising problem [6], which can be solved directly by the soft threshold method using ( 24)…”
Section: A Derivative Fidelity-based Total Generalized Variation Meth...mentioning
confidence: 99%
See 1 more Smart Citation
“…This is a typical 2 − 1 denoising problem [6], which can be solved directly by the soft threshold method using ( 24)…”
Section: A Derivative Fidelity-based Total Generalized Variation Meth...mentioning
confidence: 99%
“…Because the function in (2) is both simple and easily computable, Tikhonov regularization is widely used, but there are problems of excessive smoothness and failure to save key secondary details. 1 regularization [6] uses Φ(u) = u 1 , which is the sum matrix of the absolute values of each element in the image. The presence of the 1 term encourages small components of u to become exactly zero, generating sparse solutions.…”
Section: Introductionmentioning
confidence: 99%