Distributed convex optimization based on zero-gradient-sum algorithm under switching topology
From MaRDI portal
Cites work
- A Bregman Splitting Scheme for Distributed Optimization Over Networks
- A distributed fixed-time optimization algorithm for multi-agent systems
- A fixed-time convergent algorithm for distributed convex optimization in multi-agent systems
- A Multi-Agent System With a Proportional-Integral Protocol for Distributed Constrained Optimization
- Continuous finite-time stabilization of the translational and rotational double integrators
- Distributed convex optimisation with event-triggered communication in networked systems
- Distributed Subgradient Methods for Multi-Agent Optimization
- Distributed Zero-Gradient-Sum (ZGS) consensus optimisation over networks with time-varying topologies
- Distributed zero-gradient-sum algorithm for convex optimization with time-varying communication delays and switching networks
- Event-triggered consensus of multi-agent systems with nonlinear dynamics and communication delay
- Event-triggered zero-gradient-sum distributed optimisation algorithm with time-varying communication delays
- Finite-Time Consensus Problems for Networks of Dynamic Agents
- Finite-time convergent distributed consensus optimisation over networks
- Finite-Time Distributed Convex Optimization for Continuous-Time Multiagent Systems With Disturbance Rejection
- Finite-Time Distributed Tracking Control for Multi-Agent Systems With a Virtual Leader
- Finite-time formation control for multi-agent systems
- Finite-time stabilization and synchronization of complex dynamical networks with nonidentical nodes of different dimensions
- Fixed-time consensus of nonlinear multi-agent systems with stochastically switching topologies
- Fixed-time time-varying formation tracking for nonlinear multi-agent systems under event-triggered mechanism
- Introductory lectures on convex optimization. A basic course.
- Leader Following of Nonlinear Agents With Switching Connective Network and Coupling Delay
- Local Prediction for Enhanced Convergence of Distributed Optimization Algorithms
- Push–Pull Gradient Methods for Distributed Optimization in Networks
- Time-varying multi-objective optimisation over switching graphs via fixed-time consensus algorithms
- Zero-Gradient-Sum Algorithms for Distributed Convex Optimization: The Continuous-Time Case
Cited in
(2)
This page was built for publication: Distributed convex optimization based on zero-gradient-sum algorithm under switching topology
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6882832)