General H/sup infinity / optimization: numerical advice and a way to treat plant uncertainty

Abstract

A major part of this paper is devoted to describing numerical experience with (OPT). The authors make tentative suggestions for those who are developing computer methods for solving (OPT) or (UNCOPT') based on iterating solutions to successive A-A-K problems. Rather than focusing on a particular algorithm, the authors give qualitative properties which will be useful in studying many algorithms as well as in understanding worst case frequency-domain optimization in general.<>