Constrained distributed online convex optimization with bandit feedback for unbalanced digraphs
Abstract In this study, a distributed primal‐dual bandit feedback method for online convex optimization with time‐varying coupled inequality constraints on unbalanced directed graphs is proposed. A multiagent network is considered in which agents exchange the estimations of the dual optimizer and th...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2024-01-01
|
| Series: | IET Control Theory & Applications |
| Subjects: | |
| Online Access: | https://doi.org/10.1049/cth2.12548 |