A decentralized quadratic dynamic matrix control algorithm

Abstract This paper shows how a computationally intensive quadratic dynamic matrix control (QDMC) problem can be decomposed to a number of smaller, less demanding problems which can be solved independently. The theoretical development hinges upon reformulating the QDMC optimization so that the computation of the future control moves in decentralized. Examples demonstrate the performance and the CPU time requirements of the proposed algorithm.