Coordinate dual averaging for decentralized online optimization with nonseparable global objectives

S Lee, A Nedić, M Raginsky - IEEE Transactions on Control of …, 2016 - ieeexplore.ieee.org
We consider a decentralized online convex optimization problem in a network of agents,
where each agent controls only a coordinate (or a part) of the global decision vector. For …

Decentralized online optimization with global objectives and local communication

A Nedić, S Lee, M Raginsky - 2015 American Control …, 2015 - ieeexplore.ieee.org
We consider a decentralized online convex optimization problem in a static undirected
network of agents, where each agent controls only a coordinate (or a part) of the global …

Stochastic dual averaging for decentralized online optimization on time-varying communication graphs

S Lee, A Nedić, M Raginsky - IEEE Transactions on Automatic …, 2017 - ieeexplore.ieee.org
We consider a decentralized online convex optimization problem in a network of agents,
where each agent controls only a coordinate (or a part) of the global decision vector. For …

Decentralized online convex optimization with feedback delays

X Cao, T Başar - IEEE Transactions on Automatic Control, 2021 - ieeexplore.ieee.org
In online decision making, feedback delays often arise due to the latency caused by
computation and communication in practical systems. In this article, we study decentralized …

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 …

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 …

Distributed online convex optimization on time-varying directed graphs

M Akbari, B Gharesifard, T Linder - IEEE Transactions on …, 2015 - ieeexplore.ieee.org
This paper introduces a class of discrete-time distributed online optimization algorithms, with
a group of agents whose communication topology is given by a uniformly strongly connected …

Distributed primal-dual methods for online constrained optimization

S Lee, MM Zavlanos - 2016 American Control Conference …, 2016 - ieeexplore.ieee.org
This paper introduces a decentralized primal-dual method for online distributed optimization
involving global constraints. We employ a consensus-based framework and exploit the …

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 over jointly connected digraphs

D Mateos-Núnez, J Cortés - IEEE Transactions on Network …, 2014 - ieeexplore.ieee.org
This paper considers networked online convex optimization scenarios from a regret analysis
perspective. At each round, each agent in the network commits to a decision and incurs in a …