论文信息 - State-space formulae for discrete-time H∞ optimization

State-space formulae for discrete-time H∞ optimization

Abstract State-space formulae and proofs are given for ail the important steps in discrete-time H 8 optimization. The steps closely follow the algorithms for continuous-time systems, but there are some technically involved differences in the detail that make their derivation non-trivial.

I. Postlethwaite | M. Tsai | S. O'Young | D. Gu

[1] Z. Nehari. On Bounded Bilinear Forms , 1957 .

[2] P. Dorato,et al. Optimal linear regulators: The discrete-time case , 1971 .

[3] K. Mrtensson. On the matrix riccati equation , 1971 .

[4] Brian D. O. Anderson,et al. Recursive algorithm for spectral factorization , 1974 .

[5] L. Silverman,et al. Model reduction via balanced state space representations , 1982 .

[6] C. Jacobson,et al. A connection between state-space and doubly coprime fractional representations , 1984 .

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

[8] John C. Doyle,et al. The general distance problem in H∞ optimal control theory , 1986 .

[9] Ian Postlethwaite,et al. A state-space approach to super-optimal H/sup infinity / control problems , 1988 .

[10] Ian Postlethwaite,et al. State-space approach to discrete-time super-optimal H ∞ control problems , 1989 .

[11] Keith Glover,et al. State-space algorithm for the computation of superoptimal matrix interpolating functions , 1989 .