Premium
Development of a skew µ lower bound
Author(s) -
Holland Rod,
Young Peter,
Zhu Chuanjiang
Publication year - 2005
Publication title -
international journal of robust and nonlinear control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.361
H-Index - 106
eISSN - 1099-1239
pISSN - 1049-8923
DOI - 10.1002/rnc.1003
Subject(s) - skew , extension (predicate logic) , focus (optics) , upper and lower bounds , computation , polynomial , mathematical optimization , computer science , mathematics , power (physics) , time complexity , algorithm , mathematical analysis , telecommunications , physics , optics , programming language , quantum mechanics
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 µ lower bound derivation to the skew µ lower bound and show its direct computation by way of a power algorithm. Copyright © 2005 John Wiley & Sons, Ltd.