.png){kind=icon}
返回
Distributed constrained optimization for multi-agent systems over a directed graph with piecewise stepsize
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jfranklin.2020.03.035.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, the distributed constrained optimization problem over a directed graph is considered. We assume that the digraph has a row-stochastic adjacency matrix, which corresponds to the case when agents assign weights to the received information individually. We present an algorithm that converges to the optimal solution even with a time-varying stepsize which is not attenuated to zero. The choice of stepsizes is relatively easy. The usable type of stepsizes is added. The diminishing or constant stepsizes can be used in our algorithm. Equality constraints and set constraints are also considered in this paper. Convergence analysis of the proposed algorithm relies on a conversion theorem between column- stochastic and row-stochastic matrices. Finally, the results of the numerical simulation are provided to verify the effectiveness of the proposed algorithm. (c) 2020 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.
Keyword:
RESOURCE-ALLOCATION
CONSENSUS
ALGORITHMS
TRACKING
DESIGN
DELAY
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
J
IF:
3.7
论文数:
6.4K
被引数:
1.5W
机构
引用论文
.png){kind=icon}
Leader-following-based distributed Kalman filtering in sensor networks with communication delay
PREAI
分享收藏分享收藏A Multi-Agent System With a Proportional-Integral Protocol for Distributed Constrained Optimization
PREAI
分享收藏
查看更多内容