1986/08/01 by CHENG-CHIH CHU, Cheng-Chih Chu, JOHN C. DOYLE +3 · 1 citation
Engineering · Mathematics · Physics and Astronomy · #Applied mathematics #Bounded function #Computer science #Convergence (economics) #Convex function #Elasticity and Material Modeling #Function (biology) #Iterative and incremental development #Iterative method #Mathematical analysis #Mathematical optimization #Mathematics #Model Reduction and Neural Networks #Monotonic function #Numerical methods for differential equations #Optimal control #Reduction (mathematics) #Regular polygon #Simple (philosophy) #Zero (linguistics)
paper · doi:10.1080/00207178608933619
openalex publication_date 1986/08/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29
The general distance problem that arises in H∞ optimal control theory is considered. Transformations that reduce the general H∞ problem to the general distance problem are reviewed, and an iterative scheme called γ-iteration is considered, in which the general distance problem is reduced to a standard best approximation problem. The γ-iteration is viewed as a problem of finding the zero crossing of a function, This function is shown to be continuous, monotonically decreasing, convex and bounded by some very simple functions. These properties make it possible to obtain very rapid convergence of the iterative process. The issues of model-reduction and approximation in H∞-synthesis will also be addressed.