.png){kind=icon}
返回
Decentralized Dual Proximal Gradient Algorithms for Non-Smooth Constrained Composite Optimization Problems
.png){kind=icon}
PRE
AI
DOI：10.1109/TPDS.2021.3072373.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Decentralized dual methods play significant roles in large-scale optimization, which effectively resolve many constrained optimization problems in machine learning and power systems. In this article, we focus on studying a class of totally non-smooth constrained composite optimization problems over multi-agent systems, where the mutual goal of agents in the system is to optimize a sum of two separable non-smooth functions consisting of a strongly-convex function and another convex (not necessarily strongly-convex) function. Agents in the system conduct parallel local computation and communication in the overall process without leaking their private information. In order to resolve the totally non-smooth constrained composite optimization problem in a fully decentralized manner, we devise a synchronous decentralized dual proximal (SynDe-DuPro) gradient algorithm and its asynchronous version (AsynDe-DuPro) based on the randomized block-coordinate method. Both SynDe-DuPro and AsynDe-DuPro algorithms are theoretically proved to achieve the globally optimal solution to the totally non-smooth constrained composite optimization problem relied on the quasi-Fejer monotone theorem. As a main result, AsynDe-DuPro algorithm attains the globally optimal solution without requiring all agents to be activated at each iteration and thus is more robust than most existing synchronous algorithms. The practicability of the proposed algorithms and correctness of the theoretical findings are demonstrated by the experiments on a constrained Decentralized Sparse Logistic Regression (DSLR) problem in machine learning and a Decentralized Energy Resources Coordination (DERC) problem in power systems.
Keyword:
Optimization
Signal processing algorithms
Power systems
Machine learning
Machine learning algorithms
Linear programming
Multi-agent systems
Convex optimization
synchronous and asynchronous decentralized algorithms
multi-agent systems
non-smooth constrained composite optimization problems
decentralized machine learning
DSLR problems
DERC problems
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
5.2K
被引数:
1.1W
机构
引用论文
.png){kind=icon}
分享收藏A Coordinate Descent Primal-Dual Algorithm and Application to Distributed Asynchronous Optimization坐标下降原始对偶算法及其在分布式异步优化中的应用
OAAI
OAAI分享收藏分享收藏Fast and Communication-Efficient Algorithm for Distributed Support Vector Machine Training快速通信高效的分布式支持向量机训练算法
PREAI
分享收藏Distributed Parametric Consensus Optimization With an Application to Model Predictive Consensus Problem分布式参数一致性优化及其在模型预测一致性问题中的应用
PREAI
分享收藏
查看更多内容