首页|Projected subgradient based distributed convex optimization with transmission noises
Projected subgradient based distributed convex optimization with transmission noises
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NSTL
Elsevier
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.
NSTL
Elsevier
