Linear matrix inequality¶

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

Version: v2 · 2026-09-19 · History
Domain-specific #: 5343
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Convex Optimization → Mathematics

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.^[1] 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.

The load-bearing residual is not the broad topic of convex optimization. It is the domain-specific identity determined by 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. That residual remains recognizable when examples, notation, scale, or implementation change, but it disappears if the carrier is mistyped, the condition 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 fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test. This gives the entry an operational identity rather than merely a historical label.

A useful analysis keeps three layers separate. The constitutive layer says what must be true: 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 evidential layer asks what observation or proof warrants the claim: 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. The use layer asks what reasoning becomes available once the identity is established: recognizing and comparing instances of Linear matrix inequality, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions. Conflating the layers is the most common source of scope inflation.

How would you explain it like I'm…

No faithful explanation at this level. A kid-level version turns the condition into 'this number, or every entry, is at least zero.' That misses that semidefiniteness requires the whole matrix to be nonnegative in every quadratic direction at once.

Never-Negative Grid Rule

A matrix is a square grid of numbers. In a Linear matrix inequality you have some adjustable numbers, and each one turns up or down how much of a fixed grid gets added in. The rule is that the final grid must pass a special 'never negative' test. This test does not just check whether each entry is positive; it checks the grid's behavior in every direction at once. All the settings that pass form a single blob with no dents, so computers can reliably find the best settings inside it.

Semidefinite Matrix Constraint

A Linear matrix inequality says A₀ + y₁A₁ + … + yₙAₙ ⪰ 0, where the Aᵢ are fixed symmetric matrices and the yᵢ are unknowns. The symbol ⪰ 0 means positive semidefinite: all eigenvalues are nonnegative, which is the same as vᵀMv ≥ 0 for every vector v. So one LMI packs infinitely many ordinary inequalities into a single statement. The set of y's that satisfy it is convex (any segment between two solutions stays inside) and is called a spectrahedron. Semidefinite programming optimizes a linear objective over such sets, and convexity means you can find the true global best and prove it with a dual certificate.

A Linear matrix inequality has the form F(y) = A₀ + Σ yᵢAᵢ ⪰ 0, with Aᵢ fixed real symmetric (or complex Hermitian) matrices and an affine dependence on the decision variables y. Semidefiniteness means all eigenvalues of F(y) are nonnegative, equivalently vᵀF(y)v ≥ 0 for all v, enforcing every quadratic-direction inequality simultaneously. The feasible set is a spectrahedron, which is convex. Semidefinite programming minimizes linear objectives over intersections of LMIs, and convexity gives global optimality and duality-based certificates of optimality or infeasibility. One must specify whether the inequality is strict (≻) or nonstrict (⪰), and nonlinear-looking constraints are often converted into LMIs via Schur complements, which should be stated explicitly. LMIs are a specific constraint class within convex optimization, not a synonym for it.

Structural Signature¶

Carrier: the typed convex optimization carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets
Inputs or antecedent state: the exact convex optimization carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Linear matrix inequality
Constitutive operation: Decision variables linearly weight fixed matrices, eigenvalue nonnegativity enforces all quadratic-direction inequalities simultaneously and convexity permits global optimization and dual certificates.
Invariant: 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
Recognition test: 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
Output or consequence: recognizing and comparing instances of Linear matrix inequality, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions
Failure boundary: the carrier is mistyped, the condition 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 fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test

What It Is Not¶

It is not the whole field of convex optimization. The field contains many questions and methods that do not instantiate Linear matrix inequality.
It is not its most familiar example. A canonical instance directly demonstrates 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. exhibits the structure, but the example is evidence for the abstraction rather than its definition.
It is not the neighboring catalog concept Scalar linear inequality. A scalar inequality constrains one affine form; an LMI constrains an entire affine matrix through its positive-semidefinite cone.
It is not a claim that every boundary case has one uncontested classification. a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Linear matrix inequality must control the decision
It is not an unrestricted metaphor for any process that seems similar. Outside convex optimization, the vocabulary and validity conditions do not transfer literally.

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.^[2]

Definition and recognition. Determine whether a proposed instance satisfies the constitutive conditions rather than merely sharing terminology.
Construction or evolution. Track how the exact convex optimization carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Linear matrix inequality are converted, constrained, or organized by Decision variables linearly weight fixed matrices, eigenvalue nonnegativity enforces all quadratic-direction inequalities simultaneously and convexity permits global optimization and dual certificates..
Comparison. Compare instances using carrier, parameters, convention, domain, scale, boundary conditions, evidence, exact versus approximate form, and limiting behavior, without treating convenience measures as the definition.
Boundary analysis. Diagnose cases where a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Linear matrix inequality must control the decision and state which convention or theorem controls the decision.
Downstream reasoning. Use the established identity to support recognizing and comparing instances of Linear matrix inequality, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions while preserving the assumptions under which the inference is valid.

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. The disciplined statement is: given the exact convex optimization carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Linear matrix inequality, the structure counts as Linear matrix inequality exactly when 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.

This format also separates identity from measurement. Empirical, computational, or documentary proxies support recognition only under declared validity and uncertainty assumptions; formal cases require proof rather than measurement. Measurements can be noisy, implementations can approximate, and proofs can use equivalent characterizations; none of those facts licenses changing the object being measured. When reports disagree, first check scope and convention, then data or proof, and only then interpret the disagreement as substantive.

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.

The compression has a price. A single label can hide canonical, generalized, restricted, approximate, computational, empirical, and historically variant formulations of Linear matrix inequality. Good use therefore carries a small declaration of assumptions alongside the name. The abstraction manages complexity when it reduces the state space of the question while keeping the failure boundary visible; it mismanages complexity when the label substitutes for that boundary analysis.

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.
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. This step prevents the canonical example from becoming the definition.
Derive consequences. From 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, infer recognizing and comparing instances of Linear matrix inequality, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions. Record each assumption used so that a later change of setting does not silently preserve an invalid conclusion.
Test adversarial cases. Examine a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Linear matrix inequality must control the decision and an object that resembles Linear matrix inequality in purpose or vocabulary but does not satisfy its invariant is outside the class. A robust identity explains why the first is convention-sensitive and why the second is outside the class.
Compare and refine. Use carrier, parameters, convention, domain, scale, boundary conditions, evidence, exact versus approximate form, and limiting behavior to compare legitimate instances, and refine the model when discrepancies reflect hidden variation rather than failure of the abstraction itself.

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. A theorem, diagnostic, or modeling warning can travel when those roles remain literal. For example, the distinction between constitutive identity and a convenient observable transfers from A canonical instance directly demonstrates 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. to An applied instance preserves the same invariant under a changed scale, notation, jurisdiction, dataset, or implementation..^[3]

Transfer outside the home domain is weaker. The skeletal pattern—type the carrier, apply the defining mechanism of Linear matrix inequality, preserve its invariant, and derive only consequences licensed by the stated boundary—may suggest an analogy, but the domain-specific mechanisms, admissible evidence, and consequences do not come along automatically. The safe transfer procedure maps each role explicitly, checks the invariant again, and refuses the name when only a superficial resemblance remains.

Examples¶

Canonical¶

A canonical instance directly demonstrates 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. The example exposes the carrier and directly tests 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; changing incidental notation preserves the identity, while removing that condition destroys it. This example is canonical because every role can be inspected: the carrier is the typed convex optimization carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets; the operative rule is Decision variables linearly weight fixed matrices, eigenvalue nonnegativity enforces all quadratic-direction inequalities simultaneously and convexity permits global optimization and dual certificates.; the invariant is 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; and the result supports recognizing and comparing instances of Linear matrix inequality, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions.^[1] Changing incidental notation or scale leaves the structure intact, while removing 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 destroys the classification.

Mapped back: 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. → 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 → recognizing and comparing instances of Linear matrix inequality, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions

Applied / In Practice¶

An applied instance preserves the same invariant under a changed scale, notation, jurisdiction, dataset, or implementation. The applied case qualifies only because the same invariant and boundary test remain literal under changed parameters or implementation. The applied case is not licensed merely by vocabulary. It qualifies because the same recognition test—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—can be run and because the same failure boundary—the carrier is mistyped, the condition 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 fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test—remains meaningful.^[2] The case also shows why practical outputs should report assumptions, resolution, and uncertainty instead of a naked label.

Mapped back: declared instance → recognition test → boundary check → qualified use

Structural Tensions¶

T1: Axiomatic identity vs. operational recognition. The defining conditions may be exact while empirical or computational recognition is approximate. Neither pole can be removed without changing the analytical task. Diagnostic: Can the reviewer state both the exact condition and the evidence used to infer it?
T2: Local roles vs. global consequence. The mechanism is enacted through local relations, but the abstraction is usually valued for a global classification or prediction. Neither pole can be removed without changing the analytical task. Diagnostic: Does the claimed global result actually follow from the declared local conditions?
T3: Ideal form vs. finite representation. Theory states a clean invariant while data structures, measurements, or proofs expose only finite representations. Neither pole can be removed without changing the analytical task. Diagnostic: Would increasing resolution converge toward the same classification?
T4: Canonical convention vs. legitimate variants. A standard formulation supports communication, while variants may preserve the same core under changed assumptions. Neither pole can be removed without changing the analytical task. Diagnostic: Which role is invariant across variants, and which convention-specific conclusion changes?
T5: Compression vs. hidden assumptions. The name compresses a complex argument but can conceal prerequisites. Neither pole can be removed without changing the analytical task. Diagnostic: Can each downstream inference be traced to an explicit assumption?
T6: Autonomous residual vs. reduction to catalog neighbors. The candidate uses broader structures but adds an identity-bearing residual. Neither pole can be removed without changing the analytical task. Diagnostic: After subtracting the proposed parent and named neighbors, does the constitutive residual still support independent diagnostics?

Structural–Framed Character¶

The entry is structurally mixed but domain-framed. Its portable skeleton is type the carrier, apply the defining mechanism of Linear matrix inequality, preserve its invariant, and derive only consequences licensed by the stated boundary. Its identity-bearing terms—Linear matrix inequality, carrier, parameter, invariant, boundary, evidence, model, transformation, and application—derive their meaning from convex optimization and cannot be replaced by generic systems language without losing the tests that distinguish valid from invalid instances.

This mixed character explains why the abstraction is reusable inside the domain yet does not meet the Prime bar. The structure organizes reasoning, but its claims still depend on domain-specific objects, evidence, and intervention semantics.

Structural Core vs. Domain Accent¶

The structural core consists of a carrier, Decision variables linearly weight fixed matrices, eigenvalue nonnegativity enforces all quadratic-direction inequalities simultaneously and convexity permits global optimization and dual certificates., a recognition invariant, and a consequence. That skeleton may resemble patterns elsewhere, especially type the carrier, apply the defining mechanism of Linear matrix inequality, preserve its invariant, and derive only consequences licensed by the stated boundary. The domain accent is not decorative: Linear matrix inequality, carrier, parameter, invariant, boundary, evidence, model, transformation, and application determine what counts as an admissible carrier, a valid transition, and successful evidence.

The abstraction therefore remains domain-specific. A cross-domain reuse that preserves only words such as 'balance,' 'cut,' 'sequence,' 'loss,' or 'simulation' is metaphor. Literal transfer requires the original role structure and diagnostics, which in this case remain anchored in convex optimization.

This entry is a kind of Constraint.

It remains its own entry because its identity is fixed by the real symmetric or complex Hermitian matrices, affine variable map, semidefinite ordering, feasible variables, strict or nonstrict convention and any Schur-complement equivalence.

Relationships to Other Abstractions¶

Current abstraction Linear matrix inequality Domain-specific

Parents (1) — outgoing typed relations

Linear matrix inequality is a kind of Constraint Prime

It remains its own entry because its identity is fixed by the real symmetric or complex Hermitian matrices, affine variable map, semidefinite ordering, feasible variables, strict or nonstrict convention and any Schur-complement equivalence.

Hierarchy path (1) — routes to 1 parentless root

Linear matrix inequality → is a kind of Constraint

Neighborhood in Abstraction Space¶

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

Family — Convex Analysis & Optimization Structures (8 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25

Not to Be Confused With¶

Scalar linear inequality. A scalar inequality constrains one affine form; an LMI constrains an entire affine matrix through its positive-semidefinite cone.
One canonical example. An instance demonstrates the structure but does not define the whole abstraction.
Measurement or implementation of Linear matrix inequality. A proxy or realization is evidence for the abstraction, not the abstraction itself.
Generalized Linear matrix inequality. An extension qualifies only when its changed axioms and retained invariant are stated.

References¶

[1] Stephen Boyd et al., Linear Matrix Inequalities in System and Control Theory, SIAM, 1994. openlibrary.orgnot authoritative registry ↩a ↩b

[2] Lieven Vandenberghe and Stephen Boyd, 'Semidefinite Programming,' SIAM Review 38(1), 49-95 (1996). registry ↩a ↩b

[3] Aharon Ben-Tal and Arkadi Nemirovski, Lectures on Modern Convex Optimization, SIAM, 2001. registry ↩