A Distributed Optimization Algorithm with Convergence Rate
O(1/k2) for Distributed Model Predictive Control
Reference
P. Giselsson,
M.D. Doan,
T. Keviczky,
B. De Schutter, and
A. Rantzer,
"A Distributed Optimization Algorithm with Convergence Rate
O(1/k2) for Distributed Model Predictive Control," Tech.
report 12-011, Delft Center for Systems and Control, Delft University
of Technology, Delft, The Netherlands, Mar. 2012.
Abstract
We propose a distributed optimization algorithm for mixed L1/L2-norm optimization based on accelerated
gradient methods using dual decomposition. The algorithm achieves
convergence rate O(1/k2), where k is the iteration number,
which significantly improves the convergence rates of existing
duality-based distributed optimization algorithms that achieve O(1/k).
The performance of the developed algorithm is evaluated on randomly
generated optimization problems arising in distributed Model
Predictive Control (MPC). The evaluation shows that, when the problem
data is sparse and large-scale, our algorithm outperforms
state-of-the-art optimization software CPLEX and MOSEK.
Downloads
Bibtex entry
@techreport{GisDoa:12-011,
author={P. Giselsson and M.D. Doan and T. Keviczky and B. {D}e Schutter and A.
Rantzer},
title={A Distributed Optimization Algorithm with Convergence Rate
${O}(\frac{1}{k^2})$ for Distributed Model Predictive Control},
number={12-011},
institution={Delft Center for Systems and Control, Delft University of
Technology},
address={Delft, The Netherlands},
month=mar,
year={2012}
}
This page is maintained by Bart De Schutter.
Last update: February 21, 2026.