返回
Distributed Multiagent Convex Optimization Over Random Digraphs
DOI:10.1109/TAC.2019.2937499.png)
摘要
En 中文
This paper considers an unconstrained collaborative optimization of a sum of convex functions, where agents make decisions using local information in the presence of random interconnection topologies. We recast the problem as minimization of the sum of convex functions over a constraint set defined as the set of fixed-value points of a random operator derived from weighted matrices of random graphs. We show that the derived random operator has nonexpansivity property; therefore, this formulation does not need the distribution of random communication topologies. Hence, it includes random networks with/without asynchronous protocols. As an extension of the problem, we define a novel optimization problem, namely minimization of a convex function over the fixed-value point set of a nonexpansive random operator. We propose a discrete-time algorithm using diminishing step size for converging almost surely and in mean square to the global solution of the optimization problem under suitable assumptions. Consequently, as a special case, it reduces to a totally asynchronous algorithm for the distributed optimization problem. We show that fixed-value point is a bridge from deterministic analysis to random analysis of the algorithm. Finally, a numerical example illustrates the convergence of the proposed algorithm.
Keyword:
Optimization
Convex functions
Convergence
Random variables
Hilbert space
Protocols
Minimization
Asynchronous
distributed convex optimization
fixed-value point
minimization over fixed-value point set
random graphs
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
Distributed Optimization for Multiagent Systems: An Edge-Based Fixed-Time Consensus Approach多代理系统的分布式优化: 基于边缘的固定时间共识方法
A Coordinate Descent Primal-Dual Algorithm and Application to Distributed Asynchronous Optimization坐标下降原始对偶算法及其在分布式异步优化中的应用

