Return
Continuous-Time Distributed Proximal Gradient Algorithms for Nonsmooth Resource Allocation Over General Digraphs
DOI:10.1109/TNSE.2021.3070398.png)
Abstract
En 中文
This paper studies a nonsmooth resource allocation problem with network resource constraints and local set constraints, where the interaction graphs among agents are generally strongly connected digraphs. First, we design a centralized continuous-time proximal gradient algorithm, where each agent uses the global Lagrangian multipliers and the global values of constraint functions. For the case that the agents' private information could not be leaked and the global Lagrangian multipliers are not available, the agents are endowed with some additional variables to estimate those global information via consensus protocols. Then, we construct a class of continuous-time distributed proximal gradient algorithms by using a two-time scale mechanism to integrate the proposed proximal gradient algorithm and consensus protocols. By adopting Lyapunov stability theory and convex optimization theory, we prove that the decision variables asymptotically converge to the optimal solution of the nonsmooth resource allocation problem. Finally, numerical simulations are applied to illustrate the effectiveness of the proposed algorithms.
Keywords:
Nonsmooth resource allocation
proximal gradient algorithm
consensus protocol
two-time scale mechanism
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
7.9
Papers:
2.6K
Citations:
10.0K
Organization
Cited Papers
Developmental Progression to Infectivity in
Trypanosoma brucei
Triggered by an RNA-Binding Protein
Science
IF0
Initialization-free privacy-guaranteed distributed algorithm for economic dispatch problem
AUTOMATICA
IF5.9
Initialization-free distributed coordination for economic dispatch under varying loads and generator commitment
AUTOMATICA
IF5.9
Synthesis of Cu3P nanocubes and their excellent electrocatalytic efficiency for the hydrogen evolution reaction in acidic solution
RSC Advances
IF0
Distributed sub-optimal resource allocation over weight-balanced graph via singular perturbation
AUTOMATICA
IF5.9

