Development of a skew μ upper bound

Exploitation of the NP hard, mixed μ problem structure provides a polynomial time algorithm that approximates μ with usually reasonable answers. When the problem is extended to the skew μ problem an extension of the existing method to the skew μ formulation is required. The focus of this paper is to extend the μ upper bound derivation to the skew μ upper bound and show its direct computation by way of a generalized eigenvalue solver and an LMI algorithm.