Optimal, constant I/O similarity scaling for full-information and state- feedback control problems (Q1199850)

The paper discusses the optimal constant scaling problem of full- information \(H_ \infty\) control. The problem arises, because it is impossible to capture all robustness and performance in a single \(H_ \infty\) norm cost function. Alternatively, diagonal similarity scalings of certain closed loop transfer functions can be used. The set of allowable diagonal scalings is problem dependent. The scaling set considered in the paper is a prescribed convex set of positive definite matrices. The solution to the posed problem is obtained by transforming the original problem into a convex feasibility problem, specifically, a structured, linear matrix inequality. In special cases, solvability of the full-information problem is equivalent to solvability of the state- feedback problem. The paper concludes with a numerical example.