Distributed sub-optimal resource allocation over weight-balanced graph via singular perturbation
arXiv:1702.01492 · doi:10.1016/j.automatica.2018.05.013
Abstract
In this paper, we consider distributed optimization design for resource allocation problems over weight-balanced graphs. With the help of singular perturbation analysis, we propose a simple sub-optimal continuous-time optimization algorithm. Moreover, we prove the existence and uniqueness of the algorithm equilibrium, and then show the convergence with an exponential rate. Finally, we verify the sub-optimality of the algorithm, which can approach the optimal solution as an adjustable parameter tends to zero.
5 figures
References in corpus (3)
- Initialization-free Distributed Algorithms for Optimal Resource Allocation with Feasibility Constraints and its Application to Economic Dispatch of Power Systems
- Energy-Efficient Power Control: A Look at 5G Wireless Technologies
- Distributed Continuous-time Approximate Projection Protocols for Shortest Distance Optimization Problems
Cited by in corpus (5)
- Distributed Optimization with Projection-free Dynamics
- Distributed Nonsmooth Robust Resource Allocation with Cardinality Constrained Uncertainty
- Solving A Class of Nonsmooth Resource Allocation Problems with Directed Graphs though Distributed Smooth Multi-Proximal Algorithms
- Distributed sub-optimal resource allocation via a projected form of singular perturbation
- A RNNs-based Algorithm for Decentralized-partial-consensus Constrained Optimization