Composite optimization with coupling constraints via penalized proximal gradient method in asynchronous networks
In this paper, we consider a composite optimization problem with linear coupling constraints in a multi-agent network. In this problem, the agents cooperatively optimize a strongly convex cost function which is the linear sum of individual cost functions composed of smooth and possibly non-smooth co...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/170708 |