Distributed safe resource allocation using barrier functions

DOI10.1016/j.automatica.2023.111051zbMath1520.93201arXiv2207.06009OpenAlexW4366825311MaRDI QIDQ6110305

Mikael Johansson, Sindri Magnússon, Xuyang Wu

Publication date: 5 July 2023

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2207.06009

zbMATH Keywords

barrier functiondistributed optimizationfeasible methodsafe resource allocation

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Networked control (93B70)

Cites Work

• Unnamed Item
• Unnamed Item
• On reconstructability of quadratic utility functions from the iterations in gradient methods
• Optimal scaling of a gradient method for distributed resource allocation
• Introductory lectures on convex optimization. A basic course.
• Rate control for communication networks: shadow prices, proportional fairness and stability
• A Distributed Algorithm for Resource Allocation Over Dynamic Digraphs
• A Proximal Dual Consensus ADMM Method for Multi-Agent Constrained Optimization
• Convergence Rate Analysis of Several Splitting Schemes
• Random Coordinate Descent Algorithms for Multi-Agent Convex Optimization Over Networks

This page was built for publication: Distributed safe resource allocation using barrier functions