Multi-cluster distributed optimization via random sleep strategy
From MaRDI portal
Publication:2423910
DOI10.1016/j.jfranklin.2019.03.021zbMath1415.93041OpenAlexW2945629825MaRDI QIDQ2423910
Chong-Xiao Shi, Guang-Hong Yang
Publication date: 21 June 2019
Published in: Journal of the Franklin Institute (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jfranklin.2019.03.021
Related Items (4)
Distributed projection subgradient algorithm for two-network zero-sum game with random sleep scheme ⋮ Decentralized proximal splitting algorithms for composite constrained convex optimization ⋮ Distributed generalized Nash equilibrium seeking: a backward-reflected-forward-backward-based algorithm ⋮ Distributed optimal output feedback consensus control for nonlinear Euler-Lagrange systems under input saturation
Cites Work
- Unnamed Item
- Distributed Nash equilibrium seeking: a gossip-based algorithm
- Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systems
- A distributed hierarchical algorithm for multi-cluster constrained optimization
- Distributed convergence to Nash equilibria in two-network zero-sum games
- Distributed multi-agent optimization subject to nonidentical constraints and communication delays
- Nash equilibrium seeking for \(N\)-coalition noncooperative games
- Convergence rate analysis of distributed optimization with projected subgradient algorithm
- Distributed Nash equilibrium seeking for aggregative games with coupled constraints
- Distributed convex optimization via continuous-time coordination algorithms with discrete-time communication
- Augmented Lagrange algorithms for distributed optimization over multi-agent networks via edge-based method
- Randomized optimal consensus of multi-agent systems
- Communication-computation tradeoff in distributed consensus optimization for MPC-based coordinated control under wireless communications
- Hierarchical constrained consensus algorithm over multi-cluster networks
- Convergence of random sleep algorithms for optimal consensus
- DSA: Decentralized Double Stochastic Averaging Gradient Algorithm
- Distributed Algorithms for Aggregative Games on Graphs
- Adaptive Fault Tolerant Control of Cooperative Heterogeneous Systems With Actuator Faults and Unreliable Interconnections
- Nash Equilibrium Computation in Subnetwork Zero-Sum Games With Switching Communications
- Explicit Convergence Rate of a Distributed Alternating Direction Method of Multipliers
- Asynchronous Gossip-Based Random Projection Algorithms Over Networks
- Distributed Optimization Over Time-Varying Directed Graphs
- Fast Distributed Gradient Methods
- Stochastic sub-gradient algorithm for distributed optimization with random sleep scheme
- Incremental Stochastic Subgradient Algorithms for Convex Optimization
- Distributed Nash Equilibrium Seeking by a Consensus Based Approach
- Distributed Continuous-Time Algorithm for Constrained Convex Optimizations via Nonsmooth Analysis Approach
- Blind Channel and Source Estimation in Networked Systems
- Distributed Subgradient Projection Algorithm Over Directed Graphs
- Distributed Subgradient Methods for Multi-Agent Optimization
- Distributed and Recursive Parameter Estimation in Parametrized Linear State-Space Models
- Constrained Consensus and Optimization in Multi-Agent Networks
- EXTRA: An Exact First-Order Algorithm for Decentralized Consensus Optimization
- Asynchronous Broadcast-Based Convex Optimization Over a Network
- Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
- A Convergent Incremental Gradient Method with a Constant Step Size
This page was built for publication: Multi-cluster distributed optimization via random sleep strategy
