Abstract

SummaryAn approach to find a static output feedback gain that makes the feedback system positive and minimizes the L1 gain is proposed. The problem of finding a static output feedback gain has 3 aspects: stabilizing the system, making the system positive, and then minimizing the L1 gain. Each subproblem is described by bilinear matrix inequality with respect to the feedback gain and the Lyapunov matrix or vector. Linear matrix inequality (LMI) that is sufficient to satisfy bilinear matrix inequality is derived using a convex‐concave decomposition, and the feedback gain sequence is calculated by an iterative solution of LMI. The sequence of the upper bounds on the design parameter is guaranteed to be monotonically nonincreasing for each algorithm. Similarly, 2 other LMIs are derived for each subproblem using another convex‐concave decomposition and PK iteration. The effectiveness of these algorithms is illustrated via several numerical examples.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call