A Caltech Library Service

The Rank One Mixed μ Problem and 'Kharitonov-Type' Analysis

Young, Peter M. (1993) The Rank One Mixed μ Problem and 'Kharitonov-Type' Analysis. California Institute of Technology , Pasadena, CA. (Unpublished)

See Usage Policy.

[img] Postscript
See Usage Policy.


Use this Persistent URL to link to this item:


The general mixed μ problem has been shown to be NP hard, so that the exact solution of the general problem is computationally intractable, except for small problems. In this paper we consider not the general problem, but a particular special case of this problem, the rank one mixed μ problem. We show that for this case the mixed μ problem is equivalent to its upper bound (which is convex), and it can in fact be computed easily (and exactly). This special case is shown to be equivalent to the so called "affine parameter variation" problem (for a polynomial with perturbed coefficients) which has been examined in detail in the literature, and for which several celebrated "Kharitonov-type" results have been proven.

Item Type:Report or Paper (Technical Report)
Group:Control and Dynamical Systems Technical Reports
Record Number:CaltechCDSTR:1993.015
Persistent URL:
Usage Policy:You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.
ID Code:28056
Deposited By: Imported from CaltechCDSTR
Deposited On:31 Aug 2006
Last Modified:03 Oct 2019 03:28

Repository Staff Only: item control page