Distributed deterministic asynchronous algorithms in time-varying graphs through Dykstra splitting (Q4624929)
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 7026359
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Distributed deterministic asynchronous algorithms in time-varying graphs through Dykstra splitting |
scientific article; zbMATH DE number 7026359 |
Statements
Distributed Deterministic Asynchronous Algorithms in Time-Varying Graphs Through Dykstra Splitting (English)
0 references
20 February 2019
0 references
distributed optimization
0 references
averaged consensus
0 references
Dykstra's algorithm
0 references
time-varying graphs
0 references
0 references
0 references
0 references
0 references
0.7751498818397522
0 references
0.7580362558364868
0 references
0.7572357654571533
0 references
0.7493458390235901
0 references
0.7461047172546387
0 references
