Fast inexact decomposition algorithms for large-scale separable convex optimization (Q2790883)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6551986
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast inexact decomposition algorithms for large-scale separable convex optimization |
scientific article; zbMATH DE number 6551986 |
Statements
Fast inexact decomposition algorithms for large-scale separable convex optimization (English)
0 references
8 March 2016
0 references
primal-dual algorithm
0 references
smoothing technique
0 references
excessive gap
0 references
Lagrangian decomposition
0 references
distributed and parallel algorithm
0 references
separable convex optimization
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9124207
0 references
0.9085008
0 references
0.9060592
0 references
0.9045989
0 references
0.9024322
0 references
0.9017178
0 references
0.8991987
0 references
0.89774173
0 references
