In this paper, a push-sum based distributed delayed dual averaging algorithm (PS-DDDA) is proposed to solve the distributed constrained optimization problem over the time-varying …
In this paper, the mixed equilibrium problem is studied by employing a continuous-time multi- agent system, where the objective of agents is to cooperatively find a point from the feasible …
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 …
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 …
In this paper, we study distributed constrained online convex optimization (OCO) problem in a system consisting of a parameter server and n clients. Each client is associated with a …
XP Rao, WY Xu, SF Yang, WW Yu - Science China Technological …, 2023 - Springer
This paper is concerned with the distributed Nash equilibrium (NE) computation problem for non-cooperative games subject to partial-decision information. For the purpose of …
W Zhang, Y Shi, B Zhang, D Yuan - arXiv preprint arXiv:2302.00663, 2023 - arxiv.org
This paper considers distributed online convex constrained optimization, in which various agents in a multi-agent system cooperate to minimize a global cost function through …
M Wei, W Yu, H Liu, D Chen - IEEE Transactions on Industrial …, 2024 - ieeexplore.ieee.org
We consider the constrained multi-agent online optimization problem in dynamic environments that are vulnerable to Byzantine attacks, where some infiltrated agents may …
K Zhang, X Yi, G Wen, M Cao, KH Johansson… - arXiv preprint arXiv …, 2024 - arxiv.org
This paper considers the distributed bandit convex optimization problem with time-varying inequality constraints over a network of agents, where the goal is to minimize network regret …