TY - JOUR
T1 - An algorithm for super-optimal H∞ design
T2 - The two-block case
AU - Gu, D. W.
AU - Tsai, M. C.
AU - Postlethwaite, I.
N1 - Funding Information:
Acknowledgement--The authors are grateful to the U.K. Science and Engineering Research Council for financial support. D.-W. Gu is also grateful to The National Natural Science Foundation of China (Grant No. 6874033). The final version of this paper was completed while I. Postlethwaite
PY - 1989/3
Y1 - 1989/3
N2 - In this paper, we consider the strengthened H∞ optimization problem in the two-block case. An algorithm for the super-optimal solution is proposed. It is based on results by the authors (IEEE Trans. Aut. Control, AC-33, 833 (1988)) for the less practical one-block case. It uses state-space models and is numerically implementable. A feature of the procedure is an optimality criterion which is a natural generalization of that used in the iterative scheme of Doyle (Lecture Notes in Advances in Multivariable Control, ONR/Honeywell Workshop, Minneapolis, U.S.A. (1984)) for the unstrengthened problem.
AB - In this paper, we consider the strengthened H∞ optimization problem in the two-block case. An algorithm for the super-optimal solution is proposed. It is based on results by the authors (IEEE Trans. Aut. Control, AC-33, 833 (1988)) for the less practical one-block case. It uses state-space models and is numerically implementable. A feature of the procedure is an optimality criterion which is a natural generalization of that used in the iterative scheme of Doyle (Lecture Notes in Advances in Multivariable Control, ONR/Honeywell Workshop, Minneapolis, U.S.A. (1984)) for the unstrengthened problem.
UR - https://www.scopus.com/pages/publications/0024627228
UR - https://www.scopus.com/pages/publications/0024627228#tab=citedBy
U2 - 10.1016/0005-1098(89)90074-5
DO - 10.1016/0005-1098(89)90074-5
M3 - Article
AN - SCOPUS:0024627228
SN - 0005-1098
VL - 25
SP - 215
EP - 221
JO - Automatica
JF - Automatica
IS - 2
ER -