.png){kind=icon}
返回
A power reformulation continuous-time algorithm for nonconvex distributed constrained optimization over multi-agent systems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2021.03.082.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Nonconvex distributed constrained optimization over multi-agent systems plays an increasingly important role in control community. However, the duality gap for a nonconvex distributed constrained optimization problem is not always zero. This brings some difficulties for the algorithm design and convergence analysis about such problems. In this paper, to eliminate the duality gap, the original distributed optimization problem is converted to an equivalent distributed one by using a partial power reformulation. Next, for solving this equivalence problem, a continuous-time algorithm is proposed over the multi-agent system where each agent exchanges local information with other agents under an undirected communication graph. It is proved that the proposed continuous-time algorithm locally converges to a strict local optimal solution of the considered original nonconvex distributed optimization problem. Numerical examples show the validness of the presented algorithm. Finally, the algorithm is applied for optimal placement. (c) 2021 Elsevier B.V. All rights reserved.
Keyword:
Partial power reformulation
Distributed nonconvex optimization
Multi-agent systems
Local convergence
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
An efficient neurodynamic model to solve nonconvex nonlinear optimization problems and its applications.png)
EXPERT SYSTEMS
EXPERT SYSTEMSIF2.3
PREAI
分享收藏
查看更多内容