LMIs in Control/LMI Matrix Properties/Minimization of Maximum Eigenvalue of a Matrix

The System


\begin{align} A(x) = A_{0}+A_{1}x_{1}+ ... + A_{n}x_{n} \end{align}$$

Note that $$ \begin{align} A_{i}, \quad i=1, 2, ..., n \end{align}$$ are symmetric matrices.

The Data


\begin{align} A_{0}, A_{1}, ..., A_{n} \quad \text{are given matrices.} \end{align}$$

The Optimization Problem
Find

$$\begin{align} x = [x_{1} \quad x_{2} ... x_{n}] \end{align}$$

to minimize,

$$\begin{align} J(x) = \lambda_{max}(A(x)) \end{align}$$

According to Lemma 1.1 in [1] page 10, the following statements are equivalent

$$\begin{align} \lambda_{max}(A(x)) \leq t \iff A(x)-tI \leq 0 \end{align}$$

The LMI: The Lyapunov Inequality
Title and mathematical description of the LMI formulation.



\begin{align} \text{min} \; \quad t:&\\ \text{s.t.} \quad \begin{bmatrix} A(x)-tI \end{bmatrix}& \leq 0 \end{align}$$

Conclusion:
$$\begin{align} x_{i}, \quad i =1, 2, ... , n \quad \text{and} \quad t > 0 \end{align}$$ are parameters to be optimized

Implementation
A link to Matlab codes for this problem in the Github repository:

https://github.com/asalimil/LMI-for-Minimizing-the-Maximum-Eigenvalue-of-Matrix/blob/master/README.md

Related LMIs
LMI for Matrix Norm Minimization