Subgradient methods and consensus algorithms for solving convex optimization problems
Bjorn Johansson, Tamás Keviczky, Mikael Johansson, Karl Henrik Johansson
KTH Royal Institute of Technology Delft University of Technology
阅读操作
确认中在文库中上传 PDF 后可生成中文音频讲解。
摘要与影响
In this paper we propose a subgradient method for solving coupled optimization problems in a distributed way given restrictions on the communication topology. The iterative procedure maintains local variables at each node and relies on local subgradient updates in combination with a consensus process. The local subgradient steps are applied simultaneously as opposed to the standard sequential or cyclic procedure. We study convergence properties of the proposed scheme using results from consensus theory and approximate subgradient methods. The framework is illustrated on an optimal distributed finite-time rendezvous problem.
逐年被引趋势
关键指标
同类平均 = 1
同领域 · 同年份 · 同类型
Google Scholar 与 OpenAlex 的被引统计范围不同,数值存在差异属正常。
AI 辅助阅读
依据:摘要
可就本文提问;依据不足时会说明。
学术脉络
学科主题
工程Distributed Control Multi-Agent Systems
Optimization and Variational Analysis · Advanced Control Systems Optimization
参考文献 12
此处列出前 3 条
引用本文 352
按被引量排序,此处列出前 3 条