A non-iterative method for computing the infimum in H∞ -optimization

This paper presents a simple and non-iterative procedure for the computation of the exact value of the infimum in the singular H∞-optimization problem, and is an extension of our earlier work. The problem formulation is general and does not place any restriction on the direct feedthrough terms betwe...

Full description

Saved in:
Bibliographic Details
Published in:International journal of control 1992-12, Vol.56 (6), p.1399-1418
Main Authors: CHEN, BEN M., SABERI, ALI, LY, UY-LOI
Format: Article
Language:English
Subjects:
Applied sciences
Computer science
control theory
systems
Control theory. Systems
Cybernetics
Exact sciences and technology
Optimal control
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper presents a simple and non-iterative procedure for the computation of the exact value of the infimum in the singular H∞-optimization problem, and is an extension of our earlier work. The problem formulation is general and does not place any restriction on the direct feedthrough terms between the control input and the controlled output variables, and between the disturbance input and the measurement output variables. Our method is applicable to a class of singular H∞-optimization problems for which the transfer functions from the control input to the controlled output and from the disturbance input to the measurement output have no invariant zeros on the jω axis and also satisfy certain geometric conditions. The computation of the infimum in our method involves solving two well-defined Riccati and two Lyapunov equations.
ISSN:0020-7179
1366-5820
DOI:10.1080/00207179208934370