.png){kind=icon}
返回
NEXT: In-Network Nonconvex Optimization
.png){kind=icon}
OA
AI
DOI：10.1109/TSIPN.2016.2524588.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We study nonconvex distributed optimization in multiagent networks with time-varying (nonsymmetric) connectivity. We introduce the first algorithmic framework for the distributed minimization of the sum of a smooth (possibly nonconvex and nonseparable) function-the agents' sum-utility-plus a convex (possibly nonsmooth and nonseparable) regularizer. The latter is usually employed to enforce some structure in the solution, typically sparsity. The proposed method hinges on successive convex approximation techniques while leveraging dynamic consensus as amechanism to distribute the computation among the agents: each agent first solves (possibly inexactly) a local convex approximation of the nonconvex original problem, and then performs local averaging operations. Asymptotic convergence to (stationary) solutions of the nonconvex problem is established. Our algorithmic framework is then customized to a variety of convex and nonconvex problems in several fields, including signal processing, communications, networking, and machine learning. Numerical results show that the new method compares favorably to existing distributed algorithms on both convex and nonconvex problems.
Keyword:
Consensus
distributed optimization
nonconvex optimization
successive convex approximation
time-varying directed graphs
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.9
论文数:
734
被引数:
1.9K
机构
引用论文
Impaired B Cell Development and Proliferation in Absence of Phosphoinositide 3-Kinase p85α.png)
Science
ScienceIF0
PREAI
分享收藏
查看更多内容