文章基本信息

标题：A Jacobi Decomposition Algorithm for Distributed Convex Optimization in Distributed Model Predictive Control
本地全文：下载
作者：Minh Dang Doan ; Moritz Diehl ; Tamas Keviczky 等
期刊名称：IFAC PapersOnLine
印刷版ISSN：2405-8963
出版年度：2017
卷号：50
期号：1
页码：4905-4911
DOI：10.1016/j.ifacol.2017.08.744
语种：English
出版社：Elsevier
摘要：AbstractIn this paper we introduce an iterative distributed Jacobi algorithm for solving convex optimization problems, which is motivated by distributed model predictive control (MPC) for linear time-invariant systems. Starting from a given feasible initial guess, the algorithm iteratively improves the value of the cost function with guaranteed feasible solutions at every iteration step, and is thus suitable for MPC applications in which hard constraints are important. The proposed iterative approach involves solving local optimization problems consisting of only few subsystems, depending on the flexible choice of decomposition and the sparsity structure of the couplings. This makes our approach more applicable to situations where the number of subsystems is large, the coupling is sparse, and local communication is available. We also provide a method for checking a posteriori centralized optimality of the converging solution, using comparison between Lagrange multipliers of the local problems. Furthermore, a theoretical result on convergence to optimality for a particular distributed setting is also provided.
关键词：Keywordsdistributed optimizationJacobi algorithmdistributed model predictive controlcooperative optimization algorithm