A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints (Q301677)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints |
scientific article |
Statements
A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints (English)
0 references
1 July 2016
0 references
convex optimization
0 references
dual decomposition
0 references
smoothing technique
0 references
fast proximal-gradient method
0 references
parallel computation
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
