ABSTRACT
This section addresses computational aspects of our approach to the linear control design based on the unified LMI formulation discussed in Chapter 9. Recall that our unified approach to control system design yields analytical solutions which are of the same mathematical nature. Specifically, many of the control problems considered in the earlier chapters can be formulated as a convex feasibility/optimization problem if the controller order is not fixed. The objective of this section is to give a computational algorithm to solve this convex problem.
