LMIs, interior point methods, complexity theory, and robustness analysis

Let /spl delta//sub /spl Sigma// be a measure of the relative stability of a stable dynamical system /spl Sigma/. Let /spl tau//sub A(/spl Sigma//) be a measure of the computational efficiency of a particular algorithm A which verifies the stability property of /spl Sigma/. For two representative cases of /spl Sigma/, we demonstrate the existence of a particular measure /spl delta//sub /spl Sigma// and an algorithm A such that, /spl delta//sub /spl Sigma///spl tau//sub A(/spl Sigma//)=c where c depends possibly on the dimension of the system /spl Sigma/ and parameters which are specific to the algorithm A, but independent of any other system characteristics. In particular, given /spl Sigma/ and A, one can estimate /spl delta//spl Sigma/ by measuring /spl tau//sub A(/spl Sigma//).

[1]  J. Tsitsiklis,et al.  NP-hardness of some linear control design problems , 1995, Proceedings of 1995 34th IEEE Conference on Decision and Control.

[2]  A. Nemirovskii Several NP-hard problems arising in robust stability analysis , 1993 .

[3]  C. A. Desoer,et al.  Nonlinear Systems Analysis , 1978 .

[4]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

[5]  James Renegar,et al.  Condition Numbers, the Barrier Method, and the Conjugate-Gradient Method , 1996, SIAM J. Optim..

[6]  James Renegar,et al.  Linear programming, complexity theory and elementary functional analysis , 1995, Math. Program..

[7]  B. Anderson A SYSTEM THEORY CRITERION FOR POSITIVE REAL MATRICES , 1967 .

[8]  Richard Bellman,et al.  Kronecker products and the second method of Lyapunov , 1959 .

[9]  John C. Doyle,et al.  Control problems and the polynomial time hierarchy , 1995, Proceedings of 1995 34th IEEE Conference on Decision and Control.

[10]  J. Tsitsiklis,et al.  Intractable problems in control theory , 1986 .

[11]  Eduardo Sontag From linear to nonlinear: some complexity comparisons , 1995, Proceedings of 1995 34th IEEE Conference on Decision and Control.

[12]  Chi-Tsong Chen,et al.  Linear System Theory and Design , 1995 .

[13]  Yurii Nesterov,et al.  Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.

[14]  David G. Luenberger,et al.  Linear and nonlinear programming , 1984 .