NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Back to Results
A non-iterative method for computing the infimum in H(infinity)-optimizationThis paper presents a simple and non-iterative procedure for the computation of the exact value of the infimum in the singular H(infinity)-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(infinity)-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-omega axis and also satisfy certain geometric conditions. The computation of the infimum in our method involves solving two well-defined Riccati and two Liapunov equations.
Document ID
19930037390
Acquisition Source
Legacy CDMS
Document Type
Reprint (Version printed in journal)
Authors
Chen, Ben M.
(New York State Univ. Stony Brook, United States)
Saberi, Ali
(Washington State Univ. Pullman, United States)
Ly, Uy-Loi
(Washington Univ. Seattle, United States)
Date Acquired
August 16, 2013
Publication Date
December 1, 1992
Publication Information
Publication: International Journal of Control
Volume: 56
Issue: 6
ISSN: 0020-7179
Subject Category
Cybernetics
Accession Number
93A21387
Funding Number(s)
CONTRACT_GRANT: NAG1-1210
Distribution Limits
Public
Copyright
Other

Available Downloads

There are no available downloads for this record.
No Preview Available