.png){kind=icon}
返回
A Fast Distributed Asynchronous Newton-Based Optimization Algorithm
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2019.2933607.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
One of the most important problems in the field of distributed optimization is the problem of minimizing a sum of local convex objective functions over a networked system. Most of the existing work in this area focuses on developing distributed algorithms in a synchronous setting under the presence of a central clock, where the agents need to wait for the slowest one to finish the update, before proceeding to the next iterate. Asynchronous distributed algorithms remove the need for a central coordinator, reduce the synchronization wait, and allow some agents to compute faster and execute more iterations. In the asynchronous setting, the only known algorithms for solving this problem could achieve an either linear or sublinear rate of convergence. In this paper, we build upon the existing literature to develop and analyze an asynchronous Newton-based method to solve a penalized version of the problem. We show that this algorithm guarantees almost sure convergence with a global linear and local quadratic rate in expectation. Numerical studies confirm the superior performance of our algorithm against other asynchronous methods.
Keyword:
Optimization
Convergence
Linear programming
Approximation algorithms
Delays
Clocks
Symmetric matrices
Agents and autonomous systems
asynchronous algorithms
network analysis and control
optimization algorithms
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
Observations on the Optical Deportment of the Atmosphere in Reference to the Phenomena of Putrefaction and Infection.png)
BMJOAAI
BMJIF0
OAAI分享收藏
A Coordinate Descent Primal-Dual Algorithm and Application to Distributed Asynchronous Optimization坐标下降原始对偶算法及其在分布式异步优化中的应用OAAI
OAAI分享收藏
查看更多内容