Decomposition Via QP

This brief presents an algorithm for decoupling multivariable systems based on quadratic programming (QP). A single framework is presented which can be used to design centralized, decentralized, and sparse structures of arbitrary dynamical order. A worked example and a case study are presented to demonstrate the usage and performance. It is shown that only previous methods based on Evolutionary Algorithms are able to achieve slightly higher performance than the proposed algorithm. However, these minor improvements are outweighed by the huge increase in time and costs associated with evolutionary optimizations.