论文信息 - An application of semidefinite programming duality to derive bounds on the H/sub /spl infin// norm of a transfer matrix

An application of semidefinite programming duality to derive bounds on the H/sub /spl infin// norm of a transfer matrix

The problem of computing the H/sub /spl infin// norm of a transfer matrix can be reformulated as a semidefinite program (SDP), by considering a certain quadratic optimal control problem for an associated linear time-invariant system. We apply convex duality theory to this SDP to derive new upper and lower bounds for the H/sub /spl infin// norm.

L. Vandenberghe | V. Balakrishnan

[1] E. Yaz. Linear Matrix Inequalities In System And Control Theory , 1998, Proceedings of the IEEE.

[2] Stephen P. Boyd,et al. Semidefinite Programming , 1996, SIAM Rev..

[3] Venkataramanan Balakrishnan,et al. Connections between duality in control theory and convex optimization , 1995, Proceedings of 1995 American Control Conference - ACC'95.

[4] Stephen P. Boyd,et al. A bisection method for computing the H∞ norm of a transfer matrix and related problems , 1989, Math. Control. Signals Syst..

[5] D. Enns. Model reduction with balanced realizations: An error bound and a frequency weighted generalization , 1984, The 23rd IEEE Conference on Decision and Control.

[6] K. Glover. All optimal Hankel-norm approximations of linear multivariable systems and their L, ∞ -error bounds† , 1984 .

[7] Thomas Kailath,et al. Linear Systems , 1980 .

[8] J. Willems. Least squares stationary optimal control and the algebraic Riccati equation , 1971 .