A subspace framework for H-infinity-norm minimization

Abstract

We deal with the minimization of the H-infinity-norm of the transfer function of a parameter-dependent descriptor system over the set of admissible parameter values. Subspace frameworks are proposed for such minimization problems where the involved systems are of large order. The proposed algorithms are greedy interpolatary approaches inspired by our recent work [Aliyev et al., SIAM J. Matrix Anal. Appl., 38 (2017), pp. 1496-1516] for the computation of the H-infinity-norm. In this work, we minimize the H-infinity-norm of a reduced-order parameter-dependent system obtained by two-sided restrictions onto certain subspaces. Then we expand the subspaces so that Hermite interpolation properties hold between the full and reduced-order system at the optimal parameter value for the reduced-order system. We formally establish the superlinear convergence of the subspace frameworks under some smoothness and nondegeneracy assumptions. The fast convergence of the proposed frameworks in practice is illustrated by several large-scale systems.