.png){kind=icon}
返回
Continuous-Time Distributed Subgradient Algorithm for Convex Optimization With General Constraints
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2018.2852602.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The distributed convex optimization problem is studied in this paper for any fixed and connected network with general constraints. To solve such an optimization problem, a new type of continuous-time distributed subgradient optimization algorithm is proposed based on the Karuch-Kuhn-Tucker condition. By using tools from nonsmooth analysis and set-valued function theory. it is proved that the distributed convex optimization problem is solved on a network of agents equipped with the designed algorithm. For the case that the objective function is convex but not strictly convex, it is proved that the states of the agents associated with optimal variables could converge to an optimal solution of the optimization problem. For the case that the objective function is strictly convex, it is further shown that the states of agents associated with optimal variables could converge to the unique optimal solution. Finally, some simulations are performed to illustrate the theoretical analysis.
Keyword:
Continuous-time subgradient algorithm
distributed convex optimization
multiagent systems
nonsmooth analysis
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
7.5W
机构
引用论文
Observations on the Optical Deportment of the Atmosphere in Reference to the Phenomena of Putrefaction and Infection.png)
BMJOAAI
BMJIF0
OAAI分享收藏分享收藏Integrated Optimization Design of Combined Cooling, Heating, and Power System Coupled with Solar and Biomass EnergyEnergiesOAAI
EnergiesIF0
OAAI分享收藏On distributed constrained formation control in operator-vehicle adversarial networksAUTOMATICA
AUTOMATICAIF5.9
PREAI
分享收藏分享收藏
查看更多内容