Distributed Online Optimization for Multi-Agent Networks With Coupled Inequality Constraints
From MaRDI portal
Abstract: This paper 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 applications in many areas, such as wireless sensor networks, power systems and plug-in electric vehicles. In this problem, the cost function at each time step is the sum of local cost functions with each of them being gradually revealed to its corresponding agent, and meanwhile only local functions in coupled inequality constraints are accessible to each agent. To address this problem, a modified primal-dual algorithm, called distributed online primal-dual push-sum algorithm (DOPP), is developed in this paper, which does not rest on any assumption on parameter boundedness and is applicable to unbalanced networks. It is shown that the proposed algorithm is sublinear for both the dynamic regret and the violation of coupled inequality constraints. Finally, the theoretical results are supported by a simulation example.
Cited in
(26)- An improved distributed gradient-push algorithm for bandwidth resource allocation over wireless local area network
- Privacy-preserving dual stochastic push-sum algorithm for distributed constrained optimization
- Proximal nested primal-dual gradient algorithms for distributed constraint-coupled composite optimization
- Distributed Proximal Algorithms for Multiagent Optimization With Coupled Inequality Constraints
- Regret and Cumulative Constraint Violation Analysis for Distributed Online Constrained Convex Optimization
- Online distributed optimization with strongly pseudoconvex-sum cost functions and coupled inequality constraints
- Distributed online convex optimization with multiple coupled constraints: a double accelerated push-pull algorithm
- Privacy preserving distributed online projected residual feedback optimization over unbalanced directed graphs
- Two-timescale projection neural networks in collaborative neurodynamic approaches to global optimization and distributed optimization
- Adaptive fuzzy prescribed settling time consensus control for multi-agent systems with input hysteresis via dynamic event-triggered mechanism
- Distributed online optimisation in unknown dynamic environment
- Online composite optimization with time-varying regularizers
- Distributed constrained online convex optimization with adaptive quantization
- Online distributed nonconvex optimization with stochastic objective functions: high probability bound analysis of dynamic regrets
- Distributed online constrained convex optimization with event-triggered communication
- Distributed zeroth-order online optimization with communication delays
- Online distributed algorithms for mixed equilibrium problems in dynamic environments
- One-point residual feedback algorithms for distributed online convex and non-convex optimization
- Real-time peak-demand minimization with energy storage using competitive ratio
- Constrained distributed online convex optimization with bandit feedback for unbalanced digraphs
- Distributed stochastic constrained optimization with constant step-sizes via saddle-point dynamics
- Differentially private and communication-efficient distributed nonconvex optimization algorithms
- Dynamic regret for decentralized online bandit gradient descent with local steps
- Distributed online optimization with edge-based event-triggered communication
- Gradient-free algorithms based on weight-balancing for online distributed optimisation
- One-point residual feedback gradient tracking algorithm for distributed online optimization with gradient noises
This page was built for publication: Distributed Online Optimization for Multi-Agent Networks With Coupled Inequality Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4957606)
