Abstract
The problem of H-infinity norm minimization is represented as a feasibility problem of a bilinear matrix inequality, and the numerical optimization methods have been studied. The author has proposed a descent method. In this method, the bilinear matrix inequality is approximated by a linear matrix inequality, and the descent direction is calculated using the solution. Next, a line search method is applied to find a better controller. Numerical experiments show that the norm decreases quickly but after that it moves abruptly in some cases. In this paper, these phenomena are examined in detail, and a new line search method is proposed to improve the decrease.
