分布式约束耦合优化:利用admm一致性实现鲁棒性

Q3 Engineering
A. Mohamed Messilem , Guido Carnevale , Ruggero Carli
{"title":"分布式约束耦合优化:利用admm一致性实现鲁棒性","authors":"A. Mohamed Messilem ,&nbsp;Guido Carnevale ,&nbsp;Ruggero Carli","doi":"10.1016/j.ifacol.2025.07.067","DOIUrl":null,"url":null,"abstract":"<div><div>In this paper, we consider a network of agents that jointly aim to minimize the sum of local functions subject to coupling constraints involving all local variables. To solve this problem, we propose a novel solution based on a primal-dual architecture. The algorithm is derived starting from an alternative definition of the Lagrangian function, and its convergence to the optimal solution is proved using recent advanced results in the theory of timescale separation in nonlinear systems. The rate of convergence is shown to be linear under standard assumptions on the local cost functions. Interestingly, the algorithm is amenable to a direct implementation to deal with asynchronous communication scenarios that may be corrupted by other non-idealities such as packet loss. We numerically test the validity of our approach on a real-world application related to the provision of ancillary services in three-phase low-voltage microgrids.</div></div>","PeriodicalId":37894,"journal":{"name":"IFAC-PapersOnLine","volume":"59 4","pages":"Pages 193-198"},"PeriodicalIF":0.0000,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Distributed Constraint-Coupled Optimization: Harnessing ADMM-consensus for robustness\",\"authors\":\"A. Mohamed Messilem ,&nbsp;Guido Carnevale ,&nbsp;Ruggero Carli\",\"doi\":\"10.1016/j.ifacol.2025.07.067\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>In this paper, we consider a network of agents that jointly aim to minimize the sum of local functions subject to coupling constraints involving all local variables. To solve this problem, we propose a novel solution based on a primal-dual architecture. The algorithm is derived starting from an alternative definition of the Lagrangian function, and its convergence to the optimal solution is proved using recent advanced results in the theory of timescale separation in nonlinear systems. The rate of convergence is shown to be linear under standard assumptions on the local cost functions. Interestingly, the algorithm is amenable to a direct implementation to deal with asynchronous communication scenarios that may be corrupted by other non-idealities such as packet loss. We numerically test the validity of our approach on a real-world application related to the provision of ancillary services in three-phase low-voltage microgrids.</div></div>\",\"PeriodicalId\":37894,\"journal\":{\"name\":\"IFAC-PapersOnLine\",\"volume\":\"59 4\",\"pages\":\"Pages 193-198\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2025-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IFAC-PapersOnLine\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2405896325004136\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Engineering\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IFAC-PapersOnLine","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2405896325004136","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 0

摘要

在本文中,我们考虑了一个智能体网络,其共同目标是最小化受耦合约束的局部函数的总和,这些约束涉及所有局部变量。为了解决这个问题,我们提出了一种基于原始对偶结构的新解决方案。该算法从拉格朗日函数的另一种定义出发,并利用非线性系统时间尺度分离理论的最新成果证明了该算法收敛于最优解。在局部代价函数的标准假设下,收敛速度是线性的。有趣的是,该算法可以直接实现,以处理可能被其他非理想情况(如数据包丢失)破坏的异步通信场景。我们在与三相低压微电网提供辅助服务相关的实际应用中对我们方法的有效性进行了数值测试。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Distributed Constraint-Coupled Optimization: Harnessing ADMM-consensus for robustness
In this paper, we consider a network of agents that jointly aim to minimize the sum of local functions subject to coupling constraints involving all local variables. To solve this problem, we propose a novel solution based on a primal-dual architecture. The algorithm is derived starting from an alternative definition of the Lagrangian function, and its convergence to the optimal solution is proved using recent advanced results in the theory of timescale separation in nonlinear systems. The rate of convergence is shown to be linear under standard assumptions on the local cost functions. Interestingly, the algorithm is amenable to a direct implementation to deal with asynchronous communication scenarios that may be corrupted by other non-idealities such as packet loss. We numerically test the validity of our approach on a real-world application related to the provision of ancillary services in three-phase low-voltage microgrids.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IFAC-PapersOnLine
IFAC-PapersOnLine Engineering-Control and Systems Engineering
CiteScore
1.70
自引率
0.00%
发文量
1122
期刊介绍: All papers from IFAC meetings are published, in partnership with Elsevier, the IFAC Publisher, in theIFAC-PapersOnLine proceedings series hosted at the ScienceDirect web service. This series includes papers previously published in the IFAC website.The main features of the IFAC-PapersOnLine series are: -Online archive including papers from IFAC Symposia, Congresses, Conferences, and most Workshops. -All papers accepted at the meeting are published in PDF format - searchable and citable. -All papers published on the web site can be cited using the IFAC PapersOnLine ISSN and the individual paper DOI (Digital Object Identifier). The site is Open Access in nature - no charge is made to individuals for reading or downloading. Copyright of all papers belongs to IFAC and must be referenced if derivative journal papers are produced from the conference papers. All papers published in IFAC-PapersOnLine have undergone a peer review selection process according to the IFAC rules.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信