.png){kind=icon}
返回
A Proximal Algorithm for Distributed Optimization With Nonsmooth Inequality Constraints
.png){kind=icon}
PRE
AI
DOI：10.1109/TCSII.2023.3338217.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This brief explores a category of optimization problems that are both distributed and nonsmooth, involving nonsmooth convex functions subject to nonsmooth inequality constraints. Each agent's cost function is the sum of a convex nonsmooth function and a convex smooth function. The nonsmooth inequality constraint for each agent is also a nonsmooth convex function. The multi-agent system's associated graph is assumed to be a connected, undirected graph. With the derivative feedback technology, a proximal-based Lipschitz continuous algorithm for those problems is proposed. Then by employing the Lyapunov stability theory, we also provide the convergence analysis for the algorithm. According to the theoretical and simulative result, it shows that under the proposed algorithm, states of agents can obtain consensus at an optimal point that satisfies all nonsmooth inequality constraints.
Keyword:
Distributed optimization
multi-agent systems
primal-dual method
nonsmooth inequality constraint
proximal splitting method
期刊
I
IF:
4.9
论文数:
8.8K
被引数:
2.5W
机构
引用论文
Distributed quasi-monotone subgradient algorithm for nonsmooth convex optimization over directed graphs.png)
AUTOMATICA
OAAI
AUTOMATICAIF5.9
OAAI分享收藏Distributed Nonsmooth Optimization With Coupled Inequality Constraints via Modified Lagrangian Function基于修正拉格朗日函数的耦合不等式约束分布式非光滑优化OAAI
OAAI分享收藏Distributed Continuous-Time Optimization: Nonuniform Gradient Gains, Finite-Time Convergence, and Convex Constraint Set分布式连续时间优化: 非均匀梯度增益，有限时间收敛和凸约束集OAAI
OAAI分享收藏A Smooth Double Proximal Primal-Dual Algorithm for a Class of Distributed Nonsmooth Optimization Problems一类分布式非光滑优化问题的光滑双近似原始对偶算法
PREAI
分享收藏The Proximal Augmented Lagrangian Method for Nonsmooth Composite Optimization非光滑复合材料优化的近端增广拉格朗日方法
PREAI
分享收藏
查看更多内容