A centre–free approach for resource allocation with lower bounds
From MaRDI portal
Publication:5348382
DOI10.1080/00207179.2016.1225167zbMath1367.93046OpenAlexW2509902736MaRDI QIDQ5348382
Nicanor Quijano, Germán Obando, Naly Rakoto-Ravalontsalama
Publication date: 15 August 2017
Published in: International Journal of Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207179.2016.1225167
Communication networks in operations research (90B18) Decentralized systems (93A14) Large-scale systems (93A15)
Cites Work
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
- Optimal scaling of a gradient method for distributed resource allocation
- Shahshahani gradient-like extremum seeking
- Distributed gradient algorithm for constrained optimization with application to load sharing in power systems
- Optimal dynamic resource allocation to prevent defaults
- Networked control systems.
- Distributed algorithms for reaching consensus on general functions
- A survey on the continuous nonlinear resource allocation problem
- An approximate dynamic programming approach to resource management in multi-cloud scenarios
- Necessary and sufficient conditions for a penalty method to be exact
- Constrained Consensus and Optimization in Multi-Agent Networks
- On Distributed Convex Optimization Under Inequality and Equality Constraints
- Power Allocation and Spectrum Sharing in Multi-User, Multi-Channel Systems With Strategic Users
- Distributed Generator Coordination for Initialization and Anytime Optimization in Economic Dispatch
- Fully Distributed Algorithms for Convex Optimization Problems
This page was built for publication: A centre–free approach for resource allocation with lower bounds