.png){kind=icon}
返回
Distributed Proximal Gradient Algorithm for Nonconvex Optimization Over Time-Varying Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/TCNS.2022.3213706.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This article studies the distributed nonconvex optimization problem with nonsmooth regularization, which has wide applications in decentralized learning, estimation, and control. The objective function is the sum of local objective functions, which consist of differentiable (possibly nonconvex) cost functions and nonsmooth convex functions. This article presents a distributed proximal gradient algorithm for the nonsmooth nonconvex optimization problem. Over time-varying multiagent networks, the proposed algorithm updates local variable estimates with a constant step-size at the cost of multiple consensus steps, where the number of communication rounds increases over time. We prove that the generated local variables achieve consensus and converge to the set of critical points. Finally, we verify the efficiency of the proposed algorithm by numerical simulations.
Keyword:
Distributed proximal gradient algorithm
multiagent systems
nonconvex optimization
time-varying topology
期刊
IF:
5
论文数:
1.7K
被引数:
5.8K
机构
引用论文
A Distributed, Asynchronous, and Incremental Algorithm for Nonconvex Optimization: An ADMM Approach用于非凸优化的分布式，异步和增量算法: ADMM方法
OAAI
.png){kind=icon}
OAAI分享收藏
分享收藏Phosphine-catalyzed dimerization of activated alkenes under ambient and high pressure conditions
PREAI
分享收藏Graphene/Ionic Liquid Binary Electrode Material for High Performance Supercapacitor用于高性能超级电容器的石墨烯/离子液体二元电极材料
PREAI
分享收藏
查看更多内容