Distributed Constraint-coupled Resource Allocation: Anytime Feasibility and Violation Robustness
Abstract
This paper considers distributed resource allocation problems (DRAPs) with a coupled constraint for real-time systems. Based on primal-dual methods, we adopt a control perspective for optimization algorithm design by synthesizing a safe feedback controller using control barrier functions to enforce constraint satisfaction. On this basis, a distributed anytime-feasible resource allocation (DanyRA) algorithm is proposed. It is shown that DanyRA algorithm converges to the exact optimal solution of DRAPs while ensuring feasibility of the coupled inequality constraint at all time steps. Considering constraint violation arises from potential external interferences, a virtual queue with minimum buffer is incorporated to restore the constraint satisfaction before the pre-defined deadlines. We characterize the trade-off between convergence accuracy and violation robustness for maintaining or recovering feasibility. DanyRA algorithm is further extended to address DRAPs with a coupled equality constraint, and its linear convergence rate is theoretically established. Finally, a numerical example is provided for verification.
Cite
@article{arxiv.2508.02164,
title = {Distributed Constraint-coupled Resource Allocation: Anytime Feasibility and Violation Robustness},
author = {Wenwen Wu and Shanying Zhu and Cailian Chen and Xinping Guan},
journal= {arXiv preprint arXiv:2508.02164},
year = {2025}
}