Asynchronous gradient algorithms for a class of convex separable network flow problems (Q1915768)
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: Asynchronous gradient algorithms for a class of convex separable network flow problems |
scientific article; zbMATH DE number 894724
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Asynchronous gradient algorithms for a class of convex separable network flow problems |
scientific article; zbMATH DE number 894724 |
Statements
Asynchronous gradient algorithms for a class of convex separable network flow problems (English)
0 references
1 July 1996
0 references
distributed algorithms
0 references
single commodity strictly convex network flow
0 references
parallel iterative methods
0 references
asynchronous gradient algorithms
0 references
dual problem
0 references
0 references
0 references
0 references
0 references
0.911121428012848
0 references
0.8736705780029297
0 references
0.8130038380622864
0 references
0.8120911121368408
0 references
0.8114054203033447
0 references
