返回
Efficient parallel coordinate descent algorithm for convex optimization problems with separable constraints: Application to distributed MPC
DOI:10.1016/j.jprocont.2012.12.012.png)
摘要
En 中文
In this paper we propose a parallel coordinate descent algorithm for solving smooth convex optimization problems with separable constraints that may arise, e.g. in distributed model predictive control (MPC) for linear network systems. Our algorithm is based on block coordinate descent updates in parallel and has a very simple iteration. We prove (sub)linear rate of convergence for the new algorithm under standard assumptions for smooth convex optimization. Further, our algorithm uses local information and thus is suitable for distributed implementations. Moreover, it has low iteration complexity, which makes it appropriate for embedded control. An MPC scheme based on this new parallel algorithm is derived, for which every subsystem in the network can compute feasible and stabilizing control inputs using distributed and cheap computations. For ensuring stability of the MPC scheme, we use a terminal cost formulation derived from a distributed synthesis. Preliminary numerical tests show better performance for our optimization algorithm than other existing methods. (C) 2013 Elsevier Ltd. All rights reserved.
Keyword:
Coordinate descent optimization
Parallel algorithm
(Sub)linear convergence rate
Distributed model predictive control
Embedded control
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.9
论文数:
3.5K
被引数:
7.3K
机构
引用论文
Distributed predictive control: A non-cooperative algorithm with neighbor-to-neighbor communication for linear systems
AUTOMATICA
IF5.9
A new approach to stability analysis for constrained finite receding horizon control without end constraints无末端约束的有限滚动时域控制稳定性分析的新方法

