Fast iterative computation of optimal two-block H/sup infinity /-norm

摘要

The two-block H/sup infinity / optimization problem is discussed, in which the most computationally demanding work is the computation of the optimal H/sup infinity / norm denoted by gamma /sub 0/. The problem of computing gamma /sub 0/ can be considered as that of finding a gamma such that mu ( gamma ) is equal to 1. Some new properties of mu ( gamma ) are revealed and studied. Based on these properties and those found by C.-C. Chu and J. Doyle (1985) and Z.Z. Wang and J.B. Pearson (1984), a very fast computational algorithm for finding gamma /sub 0/ is proposed.