.png){kind=icon}
返回
A New Randomized Block-Coordinate Primal-Dual Proximal Algorithm for Distributed Optimization
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2019.2906924.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper proposes Triangularly Preconditioned Primal- Dual algorithm, a new primal-dual algorithm for minimizing the sum of a Lipschitz-differentiable convex function and two possibly nonsmooth convex functions, one of which is composed with a linear mapping. We devise a randomized block-coordinate ( BC) version of the algorithm which converges under the same stepsize conditions as the full algorithm. It is shown that both the original as well as the BC scheme feature linear convergence rate when the functions involved are either piecewise linear-quadratic, or when they satisfy a certain quadratic growth condition (which is weaker than strong convexity). Moreover, we apply the developed algorithms to the problem of multiagent optimization on a graph, thus obtaining novel synchronous and asynchronous distributed methods. The proposed algorithms are fully distributed in the sense that the updates and the stepsizes of each agent only depend on local information. In fact, no prior global coordination is required. Finally, we showcase an application of our algorithm in distributed formation control.
Keyword:
Asynchronous algorithms
block-coordinate (BC) minimization
distributed optimization
primal-dual algorithms
randomized algorithms
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
A Nonequilibrium Model for Particle Networking/Jamming and Time-Dependent Dynamic Rheology of Filled Polymers.png)
Polymers
OAAI
PolymersIF0
OAAI分享收藏A Coordinate Descent Primal-Dual Algorithm and Application to Distributed Asynchronous Optimization坐标下降原始对偶算法及其在分布式异步优化中的应用OAAI
OAAI分享收藏Myrotheciumones: Bicyclic cytotoxic lactones isolated from an endophytic fungus of Ajuga decumbens
PREAI
分享收藏
查看更多内容