Return
Distributed continuous-time proximal algorithm for nonsmooth resource allocation problem with coupled constraints
DOI:10.1016/j.automatica.2023.111309.png)
Abstract
En 中文
This paper studies the distributed resource allocation problem with nonsmooth local cost functions subject to the coupled equality and inequality constraints. In particular, each local cost function is expressed as the sum of a differentiable function and two nonsmooth functions. By using the operator splitting and primal-dual method, a continuous-time distributed proximal algorithm is developed, which can be applied to more general local cost functions that are convex but not necessarily smooth. In addition, the proposed algorithm is fully distributed in the sense that the gain parameter can be determined locally and does not require any global information of the network. By applying Lyapunov stability analysis and convex optimization theory, it is shown that the decision variables of all the agents converge to an optimal solution. Finally, a simulation example is carried out to demonstrate the effectiveness of the proposed algorithm. (c) 2023 Published by Elsevier Ltd.
Keywords:
Distributed optimization
Nonsmooth resource allocation
Proximal splitting
Coupled constraints
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.9
Papers:
1.2W
Citations:
5.2W
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

