Pages that link to "Item:Q2063835"
From MaRDI portal
The following pages link to Solving a class of nonsmooth resource allocation problems with directed graphs through distributed Lipschitz continuous multi-proximal algorithms (Q2063835):
Displaying 4 items.
- Distributed communication-sliding mirror-descent algorithm for nonsmooth resource allocation problem (Q2674925) (← links)
- Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions (Q5749161) (← links)
- Distributed extremum‐seeking based resource allocation algorithm with input dead‐zone (Q6149942) (← links)
- Distributed continuous-time proximal algorithm for nonsmooth resource allocation problem with coupled constraints (Q6537273) (← links)