A survey on distributed online optimization and online games
Distributed online optimization and online games have been increasingly researched in the
last decade, mostly motivated by their wide applications in sensor networks, robotics (eg …
last decade, mostly motivated by their wide applications in sensor networks, robotics (eg …
Distributed online optimization for multi-agent networks with coupled inequality constraints
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 …
network subject to local set constraints and coupled inequality constraints, which has a lot of …
Online distributed optimization with nonconvex objective functions via dynamic regrets
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 …
by employing a network of agents, where the objective functions allocated to agents are …
Simultaneously achieving sublinear regret and constraint violations for online convex optimization with time-varying constraints
Simultaneously Achieving Sublinear Regret and Constraint Violations for Online Convex
Optimization with Time-varying Constraints Page 1 Simultaneously Achieving Sublinear Regret …
Optimization with Time-varying Constraints Page 1 Simultaneously Achieving Sublinear Regret …
Regret and cumulative constraint violation analysis for distributed online constrained convex optimization
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 …
constraints over a network of agents. This is a sequential decision making problem with two …
Dynamic and distributed online convex optimization for demand response of commercial buildings
A Lesage-Landry, DS Callaway - IEEE Control Systems Letters, 2020 - ieeexplore.ieee.org
We extend the regret analysis of the online distributed weighted dual averaging (DWDA)
algorithm from Hosseini et al. to the dynamic setting and provide the tightest dynamic regret …
algorithm from Hosseini et al. to the dynamic setting and provide the tightest dynamic regret …
Online distributed optimization with strongly pseudoconvex-sum cost functions and coupled inequality constraints
K Lu, H Xu - Automatica, 2023 - Elsevier
In this paper, the problem of online distributed optimization with coupled inequality
constraints is studied by employing multi-agent systems. Each agent only has access to the …
constraints is studied by employing multi-agent systems. Each agent only has access to the …
Distributed online non-convex optimization with composite regret
Regret has been widely adopted as the metric of choice for evaluating the performance of
online optimization algorithms for distributed, multi-agent systems. However, variations in …
online optimization algorithms for distributed, multi-agent systems. However, variations in …
Online distributed nonconvex optimization with stochastic objective functions: High probability bound analysis of dynamic regrets
H Xu, K Lu, YL Wang - Automatica, 2024 - Elsevier
In this paper, the problem of online distributed optimization with stochastic and nonconvex
objective functions is studied by employing a multi-agent system. When making decisions …
objective functions is studied by employing a multi-agent system. When making decisions …
QC-ODKLA: Quantized and communication-censored online decentralized kernel learning via linearized ADMM
This article focuses on online kernel learning over a decentralized network. Each agent in
the network receives online streaming data and collaboratively learns a globally optimal …
the network receives online streaming data and collaboratively learns a globally optimal …