An adaptive primal-dual subgradient algorithm for online distributed constrained optimization

D Yuan, DWC Ho, GP Jiang - IEEE transactions on cybernetics, 2017 - ieeexplore.ieee.org
In this paper, we consider the problem of solving distributed constrained optimization over a
multiagent network that consists of multiple interacting nodes in online setting, where the …

On the sublinear regret of distributed primal-dual algorithms for online constrained optimization

S Lee, MM Zavlanos - arXiv preprint arXiv:1705.11128, 2017 - arxiv.org
This paper introduces consensus-based primal-dual methods for distributed online
optimization where the time-varying system objective function $ f_t (\mathbf {x}) $ is given as …

Online distributed optimization with nonconvex objective functions: Sublinearity of first-order optimality condition-based regret

K Lu, L Wang - IEEE Transactions on Automatic Control, 2021 - ieeexplore.ieee.org
In this article, the problem of online distributed optimization with a set constraint is solved by
employing a network of agents. Each agent only has access to a local objective function and …

Online distributed optimization with nonconvex objective functions via dynamic regrets

K Lu, L Wang - IEEE Transactions on Automatic Control, 2023 - ieeexplore.ieee.org
In this article, the problem of online distributed optimization subject to a convex set is studied
by employing a network of agents, where the objective functions allocated to agents are …

Regret and cumulative constraint violation analysis for distributed online constrained convex optimization

X Yi, X Li, T Yang, L Xie, T Chai… - IEEE Transactions on …, 2022 - ieeexplore.ieee.org
This article considers the distributed online convex optimization problem with time-varying
constraints over a network of agents. This is a sequential decision making problem with two …

Online learning algorithm for distributed convex optimization with time-varying coupled constraints and bandit feedback

J Li, C Gu, Z Wu, T Huang - IEEE transactions on cybernetics, 2020 - ieeexplore.ieee.org
This article focuses on multiagent distributed-constrained optimization problems in a
dynamic environment, in which a group of agents aims to cooperatively optimize a sum of …

Distributed online convex optimization with an aggregative variable

X Li, X Yi, L Xie - IEEE Transactions on Control of Network …, 2021 - ieeexplore.ieee.org
This article investigates distributed online convex optimization in the presence of an
aggregative variable without any global/central coordinators over a multiagent network. In …

Distributed online convex optimization with a bandit primal-dual mirror descent push-sum algorithm

C Wang, S Xu, D Yuan, B Zhang, Z Zhang - Neurocomputing, 2022 - Elsevier
The distributed online convex optimization problem with time-varying constraints for multi-
agent networks is addressed in this article. The purpose is to optimize a sequence of time …

Distributed online adaptive gradient descent with event-triggered communication

K Okamoto, N Hayashi, S Takai - IEEE Transactions on Control …, 2023 - ieeexplore.ieee.org
This article proposes an event-triggered adaptive gradient descent method for distributed
online optimization with a constraint set. In the proposed method, a group of agents …

Distributed online optimization for multi-agent networks with coupled inequality constraints

X Li, X Yi, L Xie - IEEE Transactions on Automatic Control, 2020 - ieeexplore.ieee.org
This article investigates the distributed online optimization problem over a multi-agent
network subject to local set constraints and coupled inequality constraints, which has a lot of …