.png){kind=icon}
返回
A Coordinate Descent Primal-Dual Algorithm and Application to Distributed Asynchronous Optimization
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2015.2512043.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Based on the idea of randomized coordinate descent of alpha-averaged operators, a randomized primal-dual optimization algorithm is introduced, where a random subset of coordinates is updated at each iteration. The algorithm builds upon a variant of a recent (deterministic) algorithm proposed by V (u) over tildeu and Condat that includes the well-known Alternating Direction Method of Multipliers as a particular case. The obtained algorithm is used to solve asynchronously a distributed optimization problem. A network of agents, each having a separate cost function containing a differentiable term, seek to find a consensus on the minimum of the aggregate objective. The method yields an algorithm where at each iteration, a random subset of agents wake up, update their local estimates, exchange some data with their neighbors, and go idle. Numerical results demonstrate the attractive performance of the method. The general approach can be naturally adapted to other situations where coordinate descent convex optimization algorithms are used with a random choice of the coordinates.
Keyword:
Consensus algorithms
coordinate descent
distributed optimization
primal-dual algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
Pyow but not hack calls of the male putty-nosed monkey (Cercopithcus nictitans) convey information about caller identity.png)
Behaviour
BehaviourIF0
PREAI
分享收藏Identification of a Novel Cytosolic Tocopherol‐Binding Protein: Structure, Specificity, and Tissue DistributionIUBMB LifeOAAI
IUBMB LifeIF0
OAAI分享收藏
查看更多内容