On Unbounded Delays in Asynchronous Parallel Fixed-Point Algorithms
The need for scalable solvers for massive optimization problems has motivated the development of asynchronous-parallel algorithms, where a set of nodes runs in parallel with little or no synchronization, thus computing with delayed information. This paper develops powerful Lyapunov-functions techniq...
Saved in:
| Published in: | Journal of scientific computing Vol. 76; no. 1; pp. 299 - 326 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
Springer US
01.07.2018
Springer Nature B.V |
| Subjects: | |
| ISSN: | 0885-7474, 1573-7691 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!