Linear matrix inequality¶

A convex constraint requiring an affine combination of symmetric or Hermitian matrices to be positive semidefinite.

Version: v1 · 2026-09-08 · History
Domain-specific #: 5343
Origin domain: convex optimization
Subdomain: convex optimization

Core Idea¶

An LMI has the form A0 plus sum y_i A_i semidefinite greater than or equal to zero; its feasible set is a spectrahedron and semidefinite programming optimizes linear objectives over intersections of such constraints. Decision variables linearly weight fixed matrices, eigenvalue nonnegativity enforces all quadratic-direction inequalities simultaneously and convexity permits global optimization and dual certificates. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

Scope of Application¶

Linear matrix inequality belongs to convex optimization and is useful where the analyst can specify the typed convex optimization carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the real symmetric or complex Hermitian matrices, affine variable map, semidefinite ordering, feasible variables, strict or nonstrict convention and any Schur-complement equivalence are explicit. The scope is broad within that domain but bounded by the need for the real symmetric or complex Hermitian matrices, affine variable map, semidefinite ordering, feasible variables, strict or nonstrict convention and any Schur-complement equivalence are explicit. Conceptual optimization identity only; safety-critical control applications require validated models and qualified engineering.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the real symmetric or complex Hermitian matrices, affine variable map, semidefinite ordering, feasible variables, strict or nonstrict convention and any Schur-complement equivalence are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Linear matrix inequality can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Linear matrix inequality. Linear matrix inequality compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: the typed convex optimization carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem. 2. Lock the constitutive rule. Express the real symmetric or complex Hermitian matrices, affine variable map, semidefinite ordering, feasible variables, strict or nonstrict convention and any Schur-complement equivalence are explicit independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of convex optimization because they reuse the typed convex optimization carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, Decision variables linearly weight fixed matrices, eigenvalue nonnegativity enforces all quadratic-direction inequalities simultaneously and convexity permits global optimization and dual certificates., and type the carrier, state every parameter and convention in the definition, test that the real symmetric or complex Hermitian matrices, affine variable map, semidefinite ordering, feasible variables, strict or nonstrict convention and any Schur-complement equivalence are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Linear matrix inequality Domain-specific

Parents (1) — more general patterns this builds on

Linear matrix inequality is a kind of Constraint Prime

The proposed strict upward parent is prime:constraint.

Hierarchy path (1) — routes to 1 parentless root

Linear matrix inequality → Constraint

Neighborhood in Abstraction Space¶

Linear matrix inequality sits in a crowded region of the domain-specific corpus (31^st percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Matrix Structure & Linear Maps (48 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-09-08