Decentralized online convex optimization based on signs of relative states

X Cao, T Başar - Automatica, 2021 - Elsevier
In this paper, we study a class of decentralized online convex optimization problems with
time-varying loss functions over multi-agent networks. We propose a decentralized online …

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 …

Push-sum distributed online optimization with bandit feedback

C Wang, S Xu, D Yuan, B Zhang… - IEEE Transactions on …, 2020 - ieeexplore.ieee.org
In this article, we concentrate on distributed online convex optimization problems over
multiagent systems, where the communication between nodes is represented by a class of …

Decentralized online convex optimization with event-triggered communications

X Cao, T Başar - IEEE Transactions on Signal Processing, 2020 - ieeexplore.ieee.org
Decentralized multi-agent optimization usually relies on information exchange between
neighboring agents, which can incur unaffordable communication overhead in practice. To …

A distributed online convex optimization algorithm with improved dynamic regret

Y Zhang, RJ Ravier, MM Zavlanos… - 2019 IEEE 58th …, 2019 - ieeexplore.ieee.org
In this paper, we consider the problem of distributed online convex optimization, where a
network of local agents aim to jointly optimize a convex function over a period of multiple …

Distributed online optimization with long-term constraints

D Yuan, A Proutiere, G Shi - IEEE Transactions on Automatic …, 2021 - ieeexplore.ieee.org
In this article, we consider distributed online convex optimization problems, where the
distributed system consists of various computing units connected through a time-varying …

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 …

Decentralized online learning methods based on weight-balancing over time-varying digraphs

C Xu, J Zhu, DO Wu - IEEE Transactions on Emerging Topics in …, 2018 - ieeexplore.ieee.org
This paper considers decentralized online optimization problems over a graph, where the
allocated objective function of each agent is revealed over time and is only known for the …

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 …

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 …