2019
DOI: 10.1109/tsp.2019.2908901
|View full text |Cite
|
Sign up to set email alerts
|

Projection-Based Regularized Dual Averaging for Stochastic Optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(2 citation statements)
references
References 50 publications
0
2
0
Order By: Relevance
“…At the reconstruction end, a RL algorithm based on nonlinear projection for the total difference regularization term is proposed. The nonlinear projection on a closed convex set [14,15] can be used to replace the derivation of the regular term, Thus, more texture details can be retained. The experimental results also show that the proposed algorithm is better than RL-TV algorithm in reconstruction effect.…”
Section: Introductionmentioning
confidence: 99%
“…At the reconstruction end, a RL algorithm based on nonlinear projection for the total difference regularization term is proposed. The nonlinear projection on a closed convex set [14,15] can be used to replace the derivation of the regular term, Thus, more texture details can be retained. The experimental results also show that the proposed algorithm is better than RL-TV algorithm in reconstruction effect.…”
Section: Introductionmentioning
confidence: 99%
“…GCV method is based on the philosophy that if an arbitrary element of the observed data is omitted, then the corresponding regularized solution should predict this observation well. The choice of regularization parameter should be independent of an orthogonal transformation of the observed data [11], [12]. The advantage of this algorithm is that the data-driven approach is completely used; optimization can be implemented without any prior knowledge.…”
Section: Introductionmentioning
confidence: 99%