Projected subgradient based distributed convex optimization with transmission noises

Li Zhang and Shuai Liu

Applied Mathematics and Computation, 2022, vol. 418, issue C

Abstract: This paper discusses a kind of convex optimization problem considering noises from information transmission in multi-agent systems. Different from previous works, we focus on the objective function which is a summation of strictly L0(F)-convex functions under random inner space. Our system is described by Itô 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 convergence rate is also investigated. Numerical examples are provided to demonstrate the results.

Keywords: Distributed convex optimization; Projected subgradient algorithm; Additive noise; Polyhedric set constraint; Random inner space (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300321008766
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:418:y:2022:i:c:s0096300321008766

DOI: 10.1016/j.amc.2021.126794

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().