Distributed sub-optimal resource allocation over weight-balanced graph via singular perturbation
From MaRDI portal
Publication:1626886
DOI10.1016/j.automatica.2018.05.013zbMath1417.91297arXiv1702.01492OpenAlexW2587442988WikidataQ129746632 ScholiaQ129746632MaRDI QIDQ1626886
Yiguang Hong, Shu Liang, Xianlin Zeng
Publication date: 21 November 2018
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.01492
Applications of optimal control and differential games (49N90) Decentralized systems (93A14) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Distributed algorithms (68W15)
Related Items (16)
Distributed optimal resource allocation over strongly connected digraphs: a surplus-based approach ⋮ Distributed optimal resource allocation with second‐order multi‐Agent systems ⋮ Distributed resource allocation of second‐order nonlinear multiagent systems ⋮ Distributed optimization without boundedness of gradients for second-order multi-agent systems over unbalanced network ⋮ Distributed least squares algorithm of continuous-time stochastic regression model based on sampled data ⋮ An event-triggered collaborative neurodynamic approach to distributed global optimization ⋮ A distributed extremum seeking based resource allocation algorithm over switching networks ⋮ Event-triggered primal-dual design with linear convergence for distributed nonstrongly convex optimization ⋮ Distributed heterogeneous multi-agent networks optimization with nonconvex velocity constraints ⋮ Predefined-time distributed optimization of general linear multi-agent systems ⋮ Two-timescale projection neural networks in collaborative neurodynamic approaches to global optimization and distributed optimization ⋮ Distributed algorithm design for optimal resource allocation problems via incremental passivity theory ⋮ Distributed sub-optimal resource allocation via a projected form of singular perturbation ⋮ Distributed optimization of general linear multi-agent systems with external disturbance ⋮ Solving a class of nonsmooth resource allocation problems with directed graphs through distributed Lipschitz continuous multi-proximal algorithms ⋮ Distributed algorithm for resource allocation problems under persistent attacks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed continuous-time approximate projection protocols for shortest distance optimization problems
- Initialization-free distributed coordination for economic dispatch under varying loads and generator commitment
- Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systems
- Optimal scaling of a gradient method for distributed resource allocation
- On linear convergence of a distributed dual gradient algorithm for linearly constrained separable convex problems
- Price-Based Coordinated Aggregation of Networked Distributed Energy Resources
- Generalized Efficiency Bounds in Distributed Resource Allocation
- Distributed Continuous-Time Convex Optimization on Weight-Balanced Digraphs
- Decentralized Resource Allocation in Dynamic Networks of Agents
- Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods
- Energy-Efficient Power Control: A Look at 5G Wireless Technologies
- Decision-Based System Identification and Adaptive Resource Allocation
- Reaching an Optimal Consensus: Dynamical Systems That Compute Intersections of Convex Sets
- Distributed Generator Coordination for Initialization and Anytime Optimization in Economic Dispatch
- A Multi-Agent System With a Proportional-Integral Protocol for Distributed Constrained Optimization
- Distributed Nonsmooth Optimization with Coupled Inequality Constraints via Modified Lagrangian Function
This page was built for publication: Distributed sub-optimal resource allocation over weight-balanced graph via singular perturbation
