Networked parallel algorithms for robust convex optimization via the scenario approach (Q4625791)
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 7029385
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Networked parallel algorithms for robust convex optimization via the scenario approach |
scientific article; zbMATH DE number 7029385 |
Statements
Networked Parallel Algorithms for Robust Convex Optimization via the Scenario Approach (English)
0 references
25 February 2019
0 references
randomly sampling
0 references
time-varying unbalanced digraphs
0 references
random projected algorithm
0 references
0 references
0 references
0 references
0 references
0.8052687048912048
0 references
0.7567108869552612
0 references
0.7490974068641663
0 references
0.7490974068641663
0 references
0.7482169270515442
0 references
