Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles

The minimum connectivity inference (MCI) problem represents an NP-hard generalization of the well-known minimum spanning tree problem. Given a set of vertices and a finite collection of subsets (of this vertex set), the MCI problem requires to find an edge set of minimal cardinality so that the vertices of each subset are connected. Although the … Read more

H2-optimal model reduction of MIMO systems

We consider the problem of approximating a $p\times m$ rational transfer function $H(s)$ of high degree by another $p\times m$ rational transfer function $\hat{H}(s)$ of much smaller degree. We derive the gradients of the $H_2$-norm of the approximation error and show how stationary points can be described via tangential interpolation. Citation Technical report UCL-INMA-2007.034, Department … Read more