Search NASASearch

NASA NTRS · 19930037390

A non-iterative method for computing the infimum in H(infinity)-optimization

Abstract

This 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.

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Chen, Ben M., Saberi, Ali, Ly, Uy-Loi. 1992-12-01. A non-iterative method for computing the infimum in H(infinity)-optimization. https://ntrs.nasa.gov/citations/19930037390

Cite the original work for its findings. Save a collection to share your selection of sources.