{
 "id": "epg9zksk7m",
 "slug": "s-procedure",
 "title": "S-procedure",
 "updated": "2026-09-30",
 "topic_path": [
  {
   "id": "physical",
   "label": "Physical world and mathematics",
   "api_url": "https://www.edgepedia.org/api/v1/topics/physical"
  },
  {
   "id": "physical.math",
   "label": "Mathematics and statistics",
   "api_url": "https://www.edgepedia.org/api/v1/topics/physical.math"
  },
  {
   "id": "physical.math.number",
   "label": "Numbers and algebra",
   "api_url": "https://www.edgepedia.org/api/v1/topics/physical.math.number"
  },
  {
   "id": "physical.math.number.linear-and-multilinear-algebra",
   "label": "Linear and multilinear algebra",
   "api_url": "https://www.edgepedia.org/api/v1/topics/physical.math.number.linear-and-multilinear-algebra"
  }
 ],
 "geo": [
  {
   "id": "geo.nongeo.t1946.physical.math",
   "label": "Non-geographic · 1946 to 2000: Mathematics and statistics",
   "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.physical.math",
   "path": [
    {
     "id": "geo.nongeo",
     "label": "Non-geographic",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo"
    },
    {
     "id": "geo.nongeo.t1946",
     "label": "Non-geographic · 1946 to 2000",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946"
    },
    {
     "id": "geo.nongeo.t1946.physical",
     "label": "Physical world and mathematics",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.physical"
    },
    {
     "id": "geo.nongeo.t1946.physical.math",
     "label": "Mathematics and statistics",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.physical.math"
    }
   ]
  }
 ],
 "excerpt": "The S-procedure is a control theory device converting quadratic implications into linear matrix inequality conditions on multipliers, sufficient in general and lossless for a single constraint.",
 "snippet": "The S-procedure is a control theory device converting quadratic implications into linear matrix inequality conditions on multipliers, sufficient in general and lossless for a single constraint.",
 "node": "physical.math.number.linear-and-multilinear-algebra",
 "markdown": "# S-procedure\n\nThe S-procedure is a device from control theory and optimization that converts a quadratic implication, the requirement that one quadratic form be nonnegative whenever other quadratic forms are nonnegative, into a [linear matrix inequality](https://www.edgepedia.org/linear-matrix-inequality) (LMI) condition on a set of nonnegative multipliers.<sup>[1](https://web.stanford.edu/~boyd/lmibook/lmibook.pdf)</sup> The resulting LMI can be checked with low computational complexity.<sup>[1](https://web.stanford.edu/~boyd/lmibook/lmibook.pdf)</sup> In general the conversion is one-way: the multiplier condition implies the original quadratic condition, so the procedure delivers a sufficient condition, with some conservatism.<sup>[2](https://web.mit.edu/braatzgroup/33_A_tutorial_on_linear_and_bilinear_matrix_inequalities.pdf)</sup> For a single constraint, under a regularity condition, the two conditions are equivalent, a property called losslessness.<sup>[3](https://ar5iv.labs.arxiv.org/html/math/0612794)</sup> This turns verification problems for systems with uncertainty, whose exact conditions are not LMIs, into semidefinite programs (an optimization problem over positive semidefinite matrices, solvable efficiently).<sup>[2](https://web.mit.edu/braatzgroup/33_A_tutorial_on_linear_and_bilinear_matrix_inequalities.pdf)</sup>\n\n| Key fact | Statement |\n|---|---|\n| What it produces | An LMI in the multipliers equivalent to (or implying) satisfaction of quadratic constraints.<sup>[1](https://web.stanford.edu/~boyd/lmibook/lmibook.pdf)</sup> |\n| Sufficient vs. exact | Sufficient in general; lossless for one constraint under a regularity condition.<sup>[3](https://ar5iv.labs.arxiv.org/html/math/0612794)</sup><sup> • </sup><sup>[4](https://laurentlessard.com/teaching/me7247/supplementary/S-lemma.pdf)</sup> |\n| Multiple constraints | In finite dimensions with quadratic forms, only the easy direction holds for two or more constraints.<sup>[4](https://laurentlessard.com/teaching/me7247/supplementary/S-lemma.pdf)</sup> |\n| Infinite-dimensional case | Lossless for any number of constraints (Megretski and Treil, 1990).<sup>[5](https://export.arxiv.org/pdf/math/0509718v1.pdf)</sup> |\n| Computational form | An LMI in the matrix variables (e.g., a Lyapunov matrix) and a diagonal multiplier.<sup>[6](https://stanford.edu/~boyd/papers/pdf/semidef_prog.pdf)</sup> |\n| Main use | Deriving LMI conditions implying a negative definite Lyapunov derivative in robustness analysis.<sup>[2](https://web.mit.edu/braatzgroup/33_A_tutorial_on_linear_and_bilinear_matrix_inequalities.pdf)</sup> |\n| Algebraic role | A nonlinear version of Farkas' lemma, related to Lagrange and Fenchel duality.<sup>[7](https://arxiv.org/html/2512.22561v1)</sup> |\n\n## How it works\n\nThe core statement concerns two quadratic forms. For symmetric matrices \\( P_{0} \\) and \\( P_{1} \\), the implication \\( x^{T} P_{1} x \\le 0 \\Rightarrow x^{T} P_{0} x \\le 0 \\) holds, under the applicable regularity condition, if and only if there exists a scalar \\( \\lambda \\ge 0 \\) such that \\( P_{0} \\preceq \\lambda P_{1} \\).<sup>[4](https://laurentlessard.com/teaching/me7247/supplementary/S-lemma.pdf)</sup> In the general quadratic-function form: if \\( q_{a}(\\bar{x}) > 0 \\) at some point \\( \\bar{x} \\), and \\( q_{a}(x) \\ge 0 \\) implies \\( q_{b}(x) \\ge 0 \\) for all \\( x \\), then there exists \\( \\lambda \\ge 0 \\) such that \\( q_{b}(x) \\ge \\lambda q_{a}(x) \\) for all \\( x \\); the multiplier inequality is a certificate for the implication.<sup>[8](https://www.princeton.edu/~aaa/Public/Teaching/ORF523/ORF523_Lec12.pdf)</sup> The multiplier condition is the LMI: checking it amounts to testing positive semidefiniteness of a matrix built from the quadratic data.<sup>[9](http://arxiv.org/pdf/1305.2444)</sup>\n\nTwo versions exist, one for nonstrict inequalities with quadratic functions that include constant and linear terms, and one for strict inequalities with pure quadratic forms.<sup>[1](https://web.stanford.edu/~boyd/lmibook/lmibook.pdf)</sup> Losslessness for a single constraint requires a regularity point: some \\( \\zeta_{0} \\) with \\( \\zeta_{0}^{T} P_{1} \\zeta_{0} > 0 \\), where \\( P_{1} \\) is the matrix of the constraint form.<sup>[1](https://web.stanford.edu/~boyd/lmibook/lmibook.pdf)</sup> When all involved functions are linear forms, the procedure reduces to the Minkowski–Farkas lemma in its homogeneous form.<sup>[10](https://www.math.univ-toulouse.fr/~jbhu/S-procedure-6juillet.pdf)</sup> With multiple constraints, only the easy direction holds in general: the set of achievable value tuples \\( (x^{T} P_{0} x, \\ldots, x^{T} P_{m} x) \\) is guaranteed convex only when \\( m = 1 \\), which is why the multiplier relaxation can be strict.<sup>[4](https://laurentlessard.com/teaching/me7247/supplementary/S-lemma.pdf)</sup>\n\n## How it is done\n\nIn Lyapunov-based robustness analysis, the practitioner postulates a positive definite [Lyapunov function](https://www.edgepedia.org/lyapunov-function) (an energy-like measure proving a system's stability by decreasing over time) with undetermined matrix variables and requires its time derivative along trajectories to be negative definite.<sup>[2](https://web.mit.edu/braatzgroup/33_A_tutorial_on_linear_and_bilinear_matrix_inequalities.pdf)</sup> [Uncertainty](https://www.edgepedia.org/uncertainty) makes this a conditional quadratic requirement, so the S-procedure is applied (when necessary) to derive LMI conditions on the undetermined matrices that imply the derivative condition.<sup>[2](https://web.mit.edu/braatzgroup/33_A_tutorial_on_linear_and_bilinear_matrix_inequalities.pdf)</sup> Concretely, the exact invariance condition is replaced by the stronger multiplier condition, yielding an LMI in the matrix variables (such as the Lyapunov matrix) and a diagonal multiplier.<sup>[6](https://stanford.edu/~boyd/papers/pdf/semidef_prog.pdf)</sup> Feasibility of this LMI, solved as a semidefinite program, is the stability or performance certificate.<sup>[2](https://web.mit.edu/braatzgroup/33_A_tutorial_on_linear_and_bilinear_matrix_inequalities.pdf)</sup>\n\n## Origin\n\nThe S-procedure is used to prove the stability of some particular nonlinear systems.<sup>[1](https://web.stanford.edu/~boyd/lmibook/lmibook.pdf)</sup> In that construction an auxiliary matrix S (for stability) is introduced, leading to a system of quadratic equations known as the Lur'e resolving equations; the term S-method was used earlier and later changed to S-procedure.<sup>[4](https://laurentlessard.com/teaching/me7247/supplementary/S-lemma.pdf)</sup> The name S-procedure appears in a monograph on the stability of nonlinear automatic control systems in which a function denoted S, the initial of \"stability\", plays a crucial role.<sup>[7](https://arxiv.org/html/2512.22561v1)</sup>\n\nThe losslessness theorem, the S-lemma, concerns the equivalence of a strict frequency-domain inequality and a strict LMI.<sup>[3](https://ar5iv.labs.arxiv.org/html/math/0612794)</sup><sup> • </sup><sup>[4](https://laurentlessard.com/teaching/me7247/supplementary/S-lemma.pdf)</sup> The S-lemma arose as a generalization of earlier results on pairs of quadratic forms, in the line of Finsler's lemma.<sup>[9](http://arxiv.org/pdf/1305.2444)</sup>\n\n## Variants\n\nUsage of the names varies: some authors reserve \"S-lemma\" for the single-constraint theorem and \"S-procedure\" for its application to nonlinear automatic control systems, while others use \"S-lemma\" for the characterization of concave quadratic inequalities implied by systems of convex quadratic inequalities.<sup>[7](https://arxiv.org/html/2512.22561v1)</sup> Beyond the strict and nonstrict versions,<sup>[1](https://web.stanford.edu/~boyd/lmibook/lmibook.pdf)</sup> the main variants concern losslessness scope. The classical S-procedure is lossless for all \\( m \\ge 1 \\) constraints in an infinite-dimensional setting, and the S-procedure with conic constraints is lossless for any family of self-adjoint operators.<sup>[5](https://export.arxiv.org/pdf/math/0509718v1.pdf)</sup> This coexists with the finite-dimensional statement that only the easy direction holds for \\( m \\ge 2 \\) quadratic forms;<sup>[4](https://laurentlessard.com/teaching/me7247/supplementary/S-lemma.pdf)</sup> the two claims concern different settings.\n\nA generalized S-procedure reduces inequality conditions on one-vector-lossless sets into LMIs without any conservatism.<sup>[11](https://doi.org/10.1137/050627551)</sup> A conic S-procedure is connected to a result of Iwasaki and co-authors concerning the equivalence of a frequency-domain inequality on a finite frequency range and constrained dissipativity for linear systems.<sup>[12](https://onlinelibrary.wiley.com/doi/10.1002/rnc.1090)</sup> A dynamic version of the S-procedure, formulated as LMIs via finite-horizon integral quadratic constraints with a terminal cost, achieves losslessness through time-domain dissipativity arguments.<sup>[13](https://ar5iv.labs.arxiv.org/html/2205.05366)</sup> Matrix versions of the S-lemma and Finsler's lemma for quadratic matrix inequalities were derived by Henk J. van Waarde and colleagues in 2023, published in the SIAM Journal on Control and Optimization.<sup>[14](https://doi.org/10.1137/22m1486807)</sup>\n\n## Applications\n\nThe S-procedure greatly extends the usefulness of LMIs by allowing non-LMI conditions that commonly arise in nonlinear systems analysis to be represented as LMIs, although with some conservatism.<sup>[2](https://web.mit.edu/braatzgroup/33_A_tutorial_on_linear_and_bilinear_matrix_inequalities.pdf)</sup> In the integral quadratic constraint (IQC) framework, inequalities describe possible signal combinations within a dynamical system and abstract nonlinear, time-varying, uncertain, or distributed elements for rigorous analysis of robust stability and performance; IQCs are most powerful when used to derive optimization-based algorithms for certification of stability and robustness of specific feedback systems, including \\( L_{2} \\) gain bounds and passivity.<sup>[15](https://web.mit.edu/6.245/www/images/rfiqc8.pdf)</sup> Robust stability and performance tests based on the full-block S-procedure and most of its variants can be viewed as IQC analysis with static, frequency-independent multipliers.<sup>[13](https://ar5iv.labs.arxiv.org/html/2205.05366)</sup>\n\nIn data-driven control, the matrix S-lemma of Henk J. van Waarde and colleagues provides general necessary and sufficient conditions for data-based quadratic stabilization of unknown noisy systems, and reduces computational complexity by separating the computation of the Lyapunov function from that of the controller.<sup>[14](https://doi.org/10.1137/22m1486807)</sup> Outside control, the S-procedure is closely connected to Shor's bound, each being readily derived from the other, and to semidefinite relaxations used in combinatorial optimization.<sup>[6](https://stanford.edu/~boyd/papers/pdf/semidef_prog.pdf)</sup>\n\n## Limitations and alternatives\n\nThe main cost is conservatism from the multipliers: the S-procedure constructs a related quadratic function by Lagrange relaxation with sign-constrained multipliers, also called scalings in the control context, and this relaxation can be strict when several constraints are combined.<sup>[13](https://ar5iv.labs.arxiv.org/html/2205.05366)</sup><sup> • </sup><sup>[4](https://laurentlessard.com/teaching/me7247/supplementary/S-lemma.pdf)</sup> Dynamic, frequency-dependent multipliers reduce conservatism relative to static ones, an approach exploited in \\( \\mu \\)-analysis and the full-block S-procedure.<sup>[13](https://ar5iv.labs.arxiv.org/html/2205.05366)</sup> The single-constraint losslessness theorem also needs a regularity assumption, the existence of a point \\( \\bar{x} \\) with \\( q_{a}(\\bar{x}) > 0 \\), and this assumption is indeed needed, as a counterexample demonstrates.<sup>[8](https://www.princeton.edu/~aaa/Public/Teaching/ORF523/ORF523_Lec12.pdf)</sup>\n\nAmong alternatives, the matrix S-lemma and Finsler-type results of Henk J. van Waarde and colleagues give conditions under which all solutions of one quadratic matrix inequality satisfy another, and are compared with the full-block S-procedure and Petersen's lemma, with existing results recovered as special cases.<sup>[14](https://doi.org/10.1137/22m1486807)</sup> Tighter relaxations exist in principle: the S-procedure is only the first level of Lasserre's hierarchy of relaxations.<sup>[16](https://dml.cz/bitstream/handle/10338.dmlcz/144746/Kybernetika_51-2015-5_8.pdf)</sup> Published comparisons report conservatism qualitatively; no quantitative figures for solver cost or for how conservatism scales with the number of constraints have been published.\n\n## References\n\n1. [Linear Matrix Inequalities in System and Control Theory (Boyd, El Ghaoui, Feron, Balakrishnan)](https://web.stanford.edu/~boyd/lmibook/lmibook.pdf)\n2. [A tutorial on linear and bilinear matrix inequalities (MIT Braatz group)](https://web.mit.edu/braatzgroup/33_A_tutorial_on_linear_and_bilinear_matrix_inequalities.pdf)\n3. [Parameter-Dependent S-Procedure And Yakubovich Lemma (Sergei V. Gusev)](https://ar5iv.labs.arxiv.org/html/math/0612794)\n4. [The S-lemma (lecture notes citing Pólik–Terlaky survey)](https://laurentlessard.com/teaching/me7247/supplementary/S-lemma.pdf)\n5. [A proof of the losslessness of the S-procedure with conic constraints (arXiv math/0509718)](https://export.arxiv.org/pdf/math/0509718v1.pdf)\n6. [Semidefinite Programming (Vandenberghe and Boyd, SIAM Review)](https://stanford.edu/~boyd/papers/pdf/semidef_prog.pdf)\n7. [Robust generalized S-Procedure](https://arxiv.org/html/2512.22561v1)\n8. [ORF523 Lecture 12: The S-lemma (Princeton)](https://www.princeton.edu/~aaa/Public/Teaching/ORF523/ORF523_Lec12.pdf)\n9. [Paper stating Yakubovich's S-Lemma and its precursors](http://arxiv.org/pdf/1305.2444)\n10. [A fresh geometrical look at the general S-procedure](https://www.math.univ-toulouse.fr/~jbhu/S-procedure-6juillet.pdf)\n11. [Generalized S-Procedure for Inequality Conditions on One-Vector-Lossless Sets and Linear System Analysis](https://doi.org/10.1137/050627551)\n12. [Conic S-procedure and constrained dissipativity for linear systems](https://onlinelibrary.wiley.com/doi/10.1002/rnc.1090)\n13. [A Dynamic S-Procedure for Dynamic Uncertainties](https://ar5iv.labs.arxiv.org/html/2205.05366)\n14. [Henk J. van Waarde and colleagues (2023). Quadratic Matrix Inequalities with Applications to Data-Based Control. SIAM Journal on Control and Optimization.](https://doi.org/10.1137/22m1486807)\n15. [Integral Quadratic Constraints (MIT 6.245 course notes)](https://web.mit.edu/6.245/www/images/rfiqc8.pdf)\n16. [Kybernetika paper on matrix inequalities and the S-procedure](https://dml.cz/bitstream/handle/10338.dmlcz/144746/Kybernetika_51-2015-5_8.pdf)\n\n---\n*Topic: Encyclopedia › Physical world and mathematics › Mathematics and statistics › Numbers and algebra › Linear and multilinear algebra*\n\n*Initially written Sep 29, 2026 · Reviewed: Sep 30, 2026 · Edited: Sep 30, 2026 · Last review: Sep 30, 2026*\n\n*Copyright 2026 EdgeChat AI, a subsidiary of Biostate AI.*\n\nLicense: Edgepedia Community License 1.0, https://www.edgepedia.org/edgepedia/license\n",
 "same_as": [
  "https://web.stanford.edu/~boyd/lmibook/lmibook.pdf",
  "https://stanford.edu/~boyd/papers/pdf/semidef_prog.pdf",
  "https://www.princeton.edu/~aaa/Public/Teaching/ORF523/ORF523_Lec12.pdf"
 ],
 "url": "https://www.edgepedia.org/s-procedure",
 "markdown_url": "https://www.edgepedia.org/s-procedure.md",
 "license": {
  "name": "Edgepedia Community License 1.0",
  "url": "https://www.edgepedia.org/edgepedia/license",
  "summary": "Free with credit, commercial use included. AI training is open to everyone. For other uses, organizations over USD 100M in revenue or 100M monthly users license separately.",
  "spdx": "LicenseRef-Edgepedia-Community-1.0"
 },
 "credit": "\"S-procedure\", Edgepedia (EdgeChat), https://www.edgepedia.org/s-procedure. Edgepedia Community License 1.0.",
 "credit_md": "\"[S-procedure](https://www.edgepedia.org/s-procedure)\", Edgepedia (EdgeChat), [https://www.edgepedia.org/s-procedure](https://www.edgepedia.org/s-procedure). [Edgepedia Community License 1.0](https://www.edgepedia.org/edgepedia/license).",
 "credit_html": "\"<a href=\"https://www.edgepedia.org/s-procedure\">S-procedure</a>\", Edgepedia (EdgeChat), <a href=\"https://www.edgepedia.org/s-procedure\">https://www.edgepedia.org/s-procedure</a>. <a href=\"https://www.edgepedia.org/edgepedia/license\">Edgepedia Community License 1.0</a>.",
 "speakable": "The S-procedure is a control theory device converting quadratic implications into linear matrix inequality conditions on multipliers, sufficient in general and lossless for a single constraint."
}