--- title: Linear Matrix Inequalities (LMIs) url: https://www.emergentmind.com/topics/linear-matrix-inequalities-lmis type: topic --- # Linear Matrix Inequalities (LMIs) A linear matrix inequality (LMI) is a matrix-valued affine constraint in which symmetric or Hermitian matrices, parameterized affinely by some variables, are required to be positive semidefinite. LMIs play a central role throughout modern convex optimization, systems and control theory, stability analysis, robust optimization, real algebraic geometry, sum-of-squares programming, and data-driven and learning-based control frameworks. Their tractability—due to convexity and the existence of efficient semidefinite programming (SDP) solvers—has led to their adoption in both finite- and infinite-dimensional settings. ## 1. Fundamental Definitions and Geometric Characterization Given $A_0, A_1, \dots, A_n \in \mathbb{S}^m$, the space of real symmetric $m \times m$ matrices, a standard (real) LMI is formulated as: \[ A(x) = A_0 + \sum_{i=1}^n x_i A_i \succeq 0, \] where $x = (x_1, \dots, x_n) \in \mathbb{R}^n$ and $\succeq 0$ denotes positive semidefiniteness. The feasible set \[ \mathcal{S} = \{x \in \mathbb{R}^n : A(x) \succeq 0\} \] is called a spectrahedron, a closed, convex semi-algebraic subset of $\mathbb{R}^n$ defined by polynomial inequalities (all principal minors of $A(x)$ nonnegative) [1309.3112]. For spectrahedra arising in the complex plane (e.g., control-oriented LMI regions), the defining characteristic function is Hermitian-valued: \[ f_{\mathfrak{D}}(z) = L + z M + \bar{z} M^\top, \] where $L, M \in \mathbb{R}^{n \times n}$ with $L$ symmetric and $z \in \mathbb{C}$. The LMI region is \[ \mathfrak{D} := \{ z \in \mathbb{C} : f_{\mathfrak{D}}(z) \prec 0 \}, \] with $\prec 0$ indicating strict negative definiteness [1910.10372]. ### Key Geometric Properties - **Boundary description:** The boundary is $\partial\mathfrak{D} = \{z \in \mathbb{C} : f_{\mathfrak{D}}(z) \preceq 0,\, \det f_{\mathfrak{D}}(z)=0\}$. - **Recession cone:** $\mathfrak{D}_{rc} = \{z \in \mathbb{C} : Mz + M^\top \bar{z} \preceq 0\}$; $\mathfrak{D}$ bounded iff $\mathfrak{D}_{rc} = \{0\}$. - **Lineality space:** Nontrivial only if $M$ is symmetric ($\mathfrak{D}$ is a vertical strip) or skew-symmetric (horizontal strip); otherwise, trivial. LMI regions can often be decomposed as intersections of elementary domains (half-planes, conic sectors, stripes, hyperbolic sides), dependent on spectral structure and commutativity of $L$, $M$ [1910.10372]. ## 2. Algebraic and Computational Structure ### Representational Power and Limitations Convex sets defined via LMIs admit semidefinite extended formulations: \[ S = \pi\left( \{ (X_1, \ldots, X_m) \in (\mathbb{S}^k)^m : \mathcal{A}_i \bullet X_i = b_i,\, X_i \succeq 0 \;\forall i \} \right), \] where the minimal $k$ is the semidefinite extension degree $\operatorname{sxdeg}(S)$ [1806.08656]. The canonical example is the sum-of-squares (SOS) cone $\Sigma_{n,2d}$, representable by a single LMI of size $\binom{n+d}{n}$. This size is optimal: No arrangement of smaller LMIs, regardless of number, suffices to represent SOS cones or the $\mathbb{S}^k_+$ cone [1806.08656]. These constraints also demarcate what can be modeled efficiently via SDP; for polynomial optimization, all SOS-based relaxations entail SDPs with block sizes lower-bounded by this combinatorial growth, which rapidly becomes computationally prohibitive [1806.08656]. ### Spectrahedral Shadows and Lifts General convex semialgebraic sets may not be spectrahedra but can often be written as **spectrahedral shadows**—projections of higher-dimensional spectrahedra [1309.3112]. Every convex planar semialgebraic set is a spectrahedral shadow. ### Feasibility and Parametric Algorithms Exactly deciding or characterizing feasibility, or finding a point in $\mathcal{S}$, can be achieved via algebraic-geometric algorithms based on the rank stratification of $A(x)$. Under genericity assumptions, these produce a rational parametrization, exploiting incidence varieties and critical point methods with complexity essentially polynomial in $n$ for fixed $m$ [1508.03715]. For parametric problems (entries polynomial in parameters $y$), quantifier-free descriptions of the feasible parameter set can be computed leveraging determinantal and polar variety decompositions, with complexity polynomial in problem size for fixed matrix size and parameter dimension [2503.01487]. ## 3. Principal Theoretical Developments: Properties, Manipulations, and Relaxations ### Fundamental Manipulation Techniques - **Schur Complement Lemma:** Central for transforming and interpreting LMI constraints; for block-matrix $[A\ B; B^\top\ C]$, $C \prec 0$, the LMI is equivalent to $A - B C^{-1} B^\top \prec 0$. - **Congruence and Scaling Transformations:** For nonsingular $X$, $F(x) \preceq 0$ iff $X^\top F(x) X \preceq 0$. - **Projection and S-procedure:** Used for variable elimination and parameter-dependent relaxations. - **Finsler's Lemma:** LMI feasibility under affine relationships. These tools underpin variable reductions, relaxations, and derivation of numerous equivalent forms of key control and system-theoretic LMIs (e.g., Lyapunov, bounded-real, and Kalman-Yakubovich-Popov (KYP) variations) [1903.08599]. ### Hierarchies and Generalizations LMIs are a special case of semidefinite representable convex constraints and can be hierarchically related: increasing the minimal matrix size strictly increases the representable set class [1806.08656]. Recent research explores less conservative relaxations for parameterized LMIs appearing in fuzzy and robust control using sum-relaxation methods such as Young's inequality, with demonstrated improvements in conservatism and feasibility [2109.09088]. ## 4. Applications and Impact in Systems and Control ### Controller Synthesis and Analysis LMIs underpin robust and optimal control design, including static and dynamic output feedback, observer design, and certification of dissipativity, passivity, and stability properties for LTI, nonlinear, port-Hamiltonian, and linear-parameter-varying (LPV) systems. For port-Hamiltonian systems, LMI-based designs yield modular (observer/feedback) gain selection guaranteeing exponential or asymptotic stability, encoded as convex matrix inequalities in physical energy and dissipation metrics [2010.06314]. For data-driven or model-free settings (e.g., learning controllers to respect specified LMI regions in the complex plane, such as disk or conic damping regions), robust pole placement can be achieved based solely on experimental open-loop data and convex LMI feasibility regions for all dynamics consistent with observed trajectories and noise models [2110.10777]. ### Lyapunov, IQCs, and Trajectory Optimization LMI formulations enable convex searches for polynomial Lyapunov or storage functions (including in Lyapunov-based global optimization, integral quadratic constraint stability analysis, trajectory and occupation measure methods) [1309.3112]. In IQC-based absolute stability, infeasibility of the primal LMI can be used (through LMI duality) to construct explicit destabilizing nonlinearities, closing the sufficiency-necessity gap in classical stability analysis [2411.14339]. ### Learning and Data-Driven Control Modern frameworks employ LMI constraints inside neural network architectures to "certify by construction" (e.g., via differentiable Douglas-Rachford projection layers) satisfaction of stability or invariance properties, enabling robust learning-based control with formal guarantees beyond what penalty-based or soft-constrained loss functions deliver [2604.05374]. ### Reinforcement Learning Quadratic Q-function structures subject to LMI constraints in the form of semidefinite programs (via Schur-complement relaxations) enable data-efficient, direct Q-learning algorithms, robustly learning stabilizing policies with far fewer samples than traditional schemes [2409.11986]. ### System Identification Physical consistency of identified inertial parameters in robotics can be exactly characterized as LMIs on moment matrices (pseudo-inertia), enforcing triangle inequalities and bounding-volume support (localizing constraints), resulting in more robust and sample-efficient parameter identification [1701.04395]. ### Robust and Time-Varying Systems Stability of piecewise linear time-varying (LTV) systems and robust performance under parametric uncertainty can be expressed as sequences of LMIs, reducible to finite-dimensional feasibility problems even under time or parameter variation, using S-procedure techniques and bisection algorithms to determine maximal uncertainty bounds [2309.13033]. ### Guaranteed-Time and Reachability Piecewise-quadratic or piecewise-polynomial Lyapunov functions constructed via LMIs over simplicial partitions, with harmonic transformation and structural relaxations, deliver certified bounds on worst-case reaching time in constrained or uncertain nonlinear systems [2510.02636]. ## 5. Free Spectrahedra, Operator-Theoretic Extensions, and Relaxation Hierarchies ### Free LMI Relaxations and Commutativity Matrix-variable relaxations (allowing noncommuting variables) define **free spectrahedra**: $D_{L_A}(n) = \{X \in (S_n)^g : L_A(X) \succeq 0\}$, where $L_A(X) = I_\nu \otimes I_n - \sum_{j=1}^g A_j \otimes X_j$. These noncommutative domains generalize scalar-valued LMIs and underlie key developments in dilation theory and operator algebras [1003.0908, 1412.1481]. #### Dilation Theorems and Scale Factors Simultaneous dilation results establish that for each $d$, all $d \times d$ symmetric contractions $X$ are compressions, up to a sharp constant $\vartheta(d)$, of tuples of commuting self-adjoint operators with spectrum in the classical LMI region. Analytic formulas for $\vartheta(d)$, derived using Beta distributions and combinatorial identities, determine the tightest scale for relaxation error between free and classical spectrahedron inclusions [1412.1481]. #### Inclusion, Dominance, and Complete Positivity Containment and dominance between LMI regions ($\mathcal{D}_{L_1} \subseteq \mathcal{D}_{L_2}$) are characterized via the theory of completely positive maps. The Choi matrix criterion translates set inclusion to explicit semidefinite programs; LMI regions are unitarily equivalent iff their minimal defining pencils are equivalent under congruence (linear Gleichstellensatz) [1003.0908, 1412.1481]. Positivstellensatz results state that any polynomial matrix strictly positive on a bounded spectrahedron can be represented as a sum of Hermitian squares plus LMI-structured terms, without archimedean hypotheses [1003.0908]. ## 6. Numerical Algorithms, Complexity, and Analytic Center Bounds ### SDP Solvers and Interior-Point Methods For LMIs embedded in SDPs, primal-dual interior-point methods are standard, with convergence guarantees provided mild regularity (Slater's condition/interiority). Each Newton step's cost is $O(n^6)$ for dense problems, but sparsity and symmetry can be exploited [1309.3112]. Linearly convergent first-order algorithms (restart subgradient or Nesterov's accelerated method) are available for large-scale feasibility, given global error bounds under Slater-type conditions [1309.2251]. ### Analytic Center and Approximation Quality The analytic center of a spectrahedron, defined as the positive definite $X$ maximizing log det $X$ over the feasible LMI set, admits new sharp entry-wise accuracy (Frobenius-norm) bounds in terms of the duality (log-det) gap via the properties of the Lambert $W$ function. This directly informs when to terminate interior-point algorithms for certified parameter-wise accuracy [2004.01115]. ## 7. Outlook, Open Directions, and Limits The theoretical boundaries of LMI representability—what classes of convex sets can be described by LMIs or their spectrahedral shadows—remain a subject of ongoing research, especially in high dimensions and for nonpolyhedral sets. For parametric and symbolic problems, specialized algebraic-geometric algorithms now provide quantifier-free certificates and exact feasibility regions for generic data, at polynomial complexity in moderate dimensions [2503.01487]. In high-complexity domains (e.g., robust control, fuzzy systems, neural certificate synthesis), efficient relaxations and structural exploitation (sparsity, symmetry, sum-relaxation, tensor lifting) are critical for practical tractability. ### Table: Principal Categories of LMI Applications and Formulations | Domain | LMI Structure/Formulation | Reference(s) | |----------------------------------|----------------------------------------------|-----------------| | State feedback synthesis | $(A+BK)^\top P + P(A+BK) \prec 0$ | [1903.08599], [2010.06314] | | Robust control/data-driven pole | $\alpha\otimes P + \beta\otimes(AP+BY) + \beta^\top\otimes(PA^\top+Y^\top B^\top) \prec 0$ (collect over $(A,B)\in\mathcal{C}$) | [2110.10777] | | SOS polynomial optimization | $f(x) = v(x)^\top A v(x),\quad A\succeq 0$ | [1806.08656], [1309.3112] | | Piecewise LTV stability | Segmentwise quadratic $Q_k(\alpha_k) \prec 0$ | [2309.13033] | | Neural control with certification| $A(x) = A_0 + \sum x_iA_i \succeq 0$, enforced by differentiable projection | [2604.05374] | | Inertial parameter identification| $J(\pi) = \begin{bmatrix}\Sigma&h\\h^\top&m\end{bmatrix} \succeq 0$ | [1701.04395] | LMIs remain the pre-eminent tractable tool for representing, analyzing, and certifying a diversity of convex specifications in systems, optimization, and data analysis. Their integration into emerging data-driven and learning-based methodologies continues to drive methodological and computational advances across control, machine learning, optimization, and applied mathematics. Source: https://www.emergentmind.com/topics/linear-matrix-inequalities-lmis