A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints (Q301677)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints |
scientific article; zbMATH DE number 6600332
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints |
scientific article; zbMATH DE number 6600332 |
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
0 references
0.9152599573135376
0 references
0.9111851453781128
0 references
0.8142521381378174
0 references
0.8024397492408752
0 references
0.7932640314102173
0 references
