Distributed resource allocation on dynamic networks in quadratic time
From MaRDI portal
Publication:503828
DOI10.1016/j.sysconle.2016.11.006zbMath1353.93012arXiv1507.07850OpenAlexW2963250913MaRDI QIDQ503828
Publication date: 23 January 2017
Published in: Systems \& Control Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.07850
Deterministic network models in operations research (90B10) Applications of graph theory to circuits and networks (94C15) Large-scale systems (93A15)
Related Items
Distributed optimal resource allocation over strongly connected digraphs: a surplus-based approach ⋮ Distributed delay-tolerant strategies for equality-constraint sum-preserving resource allocation ⋮ A distributed extremum seeking based resource allocation algorithm over switching networks ⋮ Distributed constrained optimization for multi-agent networks with nonsmooth objective functions ⋮ A Distributed ADMM-like Method for Resource Sharing over Time-Varying Networks ⋮ A dual approach for optimal algorithms in distributed optimization over networks
Cites Work
- Initialization-free distributed coordination for economic dispatch under varying loads and generator commitment
- The 2-coordinate descent method for solving double-sided simplex constrained minimization problems
- Optimal scaling of a gradient method for distributed resource allocation
- Decentralized Resource Allocation in Dynamic Networks of Agents
- On Distributed Averaging Algorithms and Quantization Effects
- Random Coordinate Descent Algorithms for Multi-Agent Convex Optimization Over Networks
- Distributed Generator Coordination for Initialization and Anytime Optimization in Economic Dispatch
- Unnamed Item
- Unnamed Item
This page was built for publication: Distributed resource allocation on dynamic networks in quadratic time