.png){kind=icon}
.png){kind=icon}
Return
Distributed Optimization With Coupling Constraints
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2022.3169955.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this article, we investigate distributed convex opti-mization with both inequality and equality constraints, where the objective function can be a general nonsmooth convex function and all the constraints can be both sparsely and densely cou-pling. By strategically integrating ideas from primal-dual, proxi-mal, and virtual-queue optimization methods, we develop a novel distributed algorithm, referred to as IPLUX, to address the prob-lem over a connected, undirected graph. We show that IPLUX achieves an O(1/k) rate of convergence in terms of optimality and feasibility, which is stronger than the convergence results of the alternative methods and eliminates the standard assumption on the compactness of the feasible region. Finally, IPLUX exhibits faster convergence and higher efficiency than several state-of-the-art methods in the simulation.
Keywords:
Convergence
Couplings
Optimization
Convex functions
Linear programming
Distributed algorithms
Transforms
Constrained optimization
distributed optimization
primal-dual method
proximal algorithm
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W