.png){kind=icon}
返回
A Proximal Atomic Coordination Algorithm for Distributed Optimization
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2021.3053907.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this article, we present a unified framework for distributed convex optimization using an algorithm called proximal atomic coordination (PAC). PAC is based on the prox-linear approach and we prove that it achieves convergence in both objective values and distance to feasibility with rate o(1/tau), where tau is the number of algorithmic iterations. We further prove that linear convergence is achieved when the objective functions are strongly convex and strongly smooth with condition number kappa(f), with the number of iterations on the order of square-root of kappa(f). We demonstrate how various decomposition strategies and coordination graphs relate to the convergence rate of PAC. We then compare this convergence rate with that of a distributed algorithm based on the popular alternating direction method of multipliers (ADMMs) method. We further compare the algorithmic complexities of PAC to ADMM and enumerate the ensuing advantages. Finally, we demonstrate yet another advantage of PAC related to privacy. All theoretical results are validated using a power distribution grid model in the context of the optimal power flow problem.
Keyword:
Electrical power systems
distributed optimization
optimization
optimization algorithms
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
Aggressive behaviour in at‐risk children: contribution of subjective well‐being and family cohesion
.png){kind=icon}
PREAI
分享收藏Distributed Constrained Optimization and Consensus in Uncertain Networks via Proximal Minimization基于近端最小化的不确定网络中的分布式约束优化和一致性OAAI
OAAI分享收藏
查看更多内容