Solving a class of nonsmooth resource allocation problems with directed graphs through distributed Lipschitz continuous multi-proximal algorithms (Q2063835): Difference between revisions
From MaRDI portal
Latest revision as of 14:58, 27 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving a class of nonsmooth resource allocation problems with directed graphs through distributed Lipschitz continuous multi-proximal algorithms |
scientific article |
Statements
Solving a class of nonsmooth resource allocation problems with directed graphs through distributed Lipschitz continuous multi-proximal algorithms (English)
0 references
3 January 2022
0 references
multi-agent systems
0 references
distributed resource allocation
0 references
nonsmooth cost function
0 references
directed graphs
0 references
splitting method
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
