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...
Saved in:
| Main Authors: | , |
|---|---|
| 其他作者: | |
| 格式: | Article |
| 語言: | English |
| 出版: |
2023
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/170708 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|