Journal article
Computational complexity of real structured singular value in lp setting
IEEE transactions on automatic control, Vol.45(11), pp.2173-2176
11/01/2000
DOI: 10.1109/9.887670
Abstract
This paper studies a generalized real structured singular value (/spl mu/) problem where uncertain parameters are bounded by an l/sub p/ norm. Two results are presented. The first one shows that this generalized /spl mu/ problem is NP-hard for any given rational number p/spl isin/[1, /spl infin/]. The NP-hardness holds as long as le, the size of the largest repeated block, exceeds one. This result generalizes the known NP-hardness result for the conventional /spl mu/ problem (with p=/spl infin/). The second result, which strengthens the first one, considers the approximability problem of the generalized /spl mu/. We show that the problem of obtaining an estimate for the generalized /spl mu/ with some guaranteed bounds on the relative error remains to be NP-hard, regardless how large this bound is.
Details
- Title: Subtitle
- Computational complexity of real structured singular value in lp setting
- Creators
- Minyue FuS. Dasgupta
- Resource Type
- Journal article
- Publication Details
- IEEE transactions on automatic control, Vol.45(11), pp.2173-2176
- Publisher
- The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
- DOI
- 10.1109/9.887670
- ISSN
- 0018-9286
- eISSN
- 1558-2523
- Language
- English
- Date published
- 11/01/2000
- Academic Unit
- Electrical and Computer Engineering
- Record Identifier
- 9984083209602771
Metrics
13 Record Views