.png){kind=icon}
返回
Projected subgradient based distributed convex optimization with transmission noises
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2021.126794.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper discusses a kind of convex optimization problem considering noises from in-formation transmission in multi-agent systems. Different from previous works, we focus on the objective function which is a summation of strictly L-0(F)-convex functions under random inner space. Our system is described by Ito formula, which leads to that it is hard to calculate second-order derivative when designing the projected subgradient algorithm. It is shown that all states in stochastic system will converge to the unique optimal state in the polyhedric set constraint by adopting projected subgradient algorithm and the con-vergence rate is also investigated. Numerical examples are provided to demonstrate the results.& nbsp;(c) 2021 Elsevier Inc. All rights reserved.
Keyword:
Distributed convex optimization
Projected subgradient algorithm
Additive noise
Polyhedric set constraint
Random inner space
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
Distributed constrained optimal consensus of multi-agent systems多智能体系统的分布式约束最优一致性.png)
AUTOMATICA
AUTOMATICAIF5.9
PREAI
分享收藏Consensus conditions of continuous-time multi-agent systems with time-delays and measurement noisesAUTOMATICA
OAAI
AUTOMATICAIF5.9
OAAI分享收藏Fenchel Dual Gradient Methods for Distributed Convex Optimization Over Time-Varying Networks时变网络上分布凸优化的Fenchel对偶梯度法OAAI
OAAI分享收藏Consensus-Based Energy Management in Smart Grid With Transmission Losses and Directed Communication
PREAI
分享收藏Exponential convergence of distributed primal-dual convex optimization algorithm without strong convexity无强凸的分布原-对偶凸优化算法的指数收敛AUTOMATICAOAAI
AUTOMATICAIF5.9
OAAI分享收藏
查看更多内容