How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Sqp active set and augmented lagrangian methods — Examples
1 · Prerequisites
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Norms and Realification
- Complex Subspace Realification
- Complexification, Realification and Real Structures
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Convex and Semicontinuous Functions on Rⁿ
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Cyclic Groups and Direct Products
- Darboux, L'Hôpital, and Taylor's Theorem
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Dimensional Normed Spaces and Riesz Lemma
- Foundations of the Real Numbers for Analysis
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inequality KKT duality and optimality certificates
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Simple Field Extensions and the Construction of the Complex Numbers
- Splitting Fields
- Sqp active set and augmented lagrangian methods
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Inverse and Implicit Function Theorems
- The Inverse Function Theorem Completed
- The Moore--Penrose Pseudoinverse and Regularised Least Squares
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
The design example solves a two-variable demand-constrained QP and checks that its active KKT certificate also identifies the original convex problem's unique minimizer. The Maratos calculation evaluates the L1 merit change for a full SQP step and the corrected step exactly, showing why a positive model prediction need not make the nonlinear full step acceptable. The equality quadratic example computes both the augmented-Lagrangian multiplier contraction and the penalty-dependent Hessian condition number, so the penalty tradeoff is visible in exact formulas.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Two-component design with an active demand constraint
Statement
Consider the design problem At , use in the SQP quadratic subproblem. The exact active-set solve returns , and is the unique global minimizer of the nonlinear problem, with active demand constraint and multiplier .
Facts & Assumptions
Given: The quadratic objective, linear demand constraint, and SQP subproblem and exact active-set conventions.
The linearized quadratic subproblem in sequential quadratic programming defines the SQP model as the objective gradient plus a positive-definite quadratic term and affine linearized constraints.
Exact exhaustive active-set solve for the SQP quadratic subproblem tests feasible active KKT supports and returns an accepted exact candidate.
The exhaustive active-set QP solve terminates with the unique minimizer exactly when feasible identifies that candidate as the unique global QP minimizer.
Convex KKT conditions certify a global minimum and an outward normal: a feasible KKT tuple for a convex objective with affine constraints certifies global optimality.
The SQP model matrix at is , and all arithmetic is exact.
Proof
At , and the linearized inequality is . The unconstrained minimizer is infeasible. On the active face , stationarity for is ; combining with the face equation gives . This point is feasible with nonnegative multiplier.
The positive-definite QP has a unique minimizer; its feasible KKT tuple passes the active-set acceptance filters in [F2]. By [F3] the returned step is exactly .
The nonlinear point is feasible and has , , and multiplier . Thus stationarity holds, the multiplier is nonnegative, and complementarity holds with . Since the objective is convex and the constraint affine, [F4] proves global optimality; strict convexity of the objective makes the minimizer unique.
A full SQP step is rejected by the L1 merit test and repaired by SOC
Statement
Let and . At a feasible point , use multiplier estimate and SQP Hessian model . For nonzero sufficiently small , the SQP step has predicted decrease , but its full step increases the L1 merit for every . The minimum-norm SOC correction makes the full corrected step pass the Armijo test with for every fixed and all sufficiently small nonzero .
Facts & Assumptions
Given: The equality-constrained SQP and L1 merit definitions, the SOC formula, and , .
The linearized quadratic subproblem in sequential quadratic programming imposes in the subproblem.
L1 exact-penalty merit and predicted decrease for SQP defines the merit and predicted decrease .
Second-order correction reduces the active constraint residual to cubic order gives the local quadratic correction size and cubic active-residual order under its smooth full-rank hypotheses.
L1 merit globalization with finite penalty and backtracking budgets tests the full SOC candidate against the Armijo threshold.
is sufficiently small and nonzero, is fixed, , the multiplier estimate is , and .
Proof
At , , , and . The unit tangent satisfies . The QP constraint gives ; minimizing on this line gives . Its QP multiplier is , since .
Here , so [F3] gives and . Direct substitution into the quadratic constraint yields The corrected first coordinate is , so the corrected objective change is . Adding the penalty contribution gives
Since and , . Also , so [F2] gives . The objective changes by , while the equality violation changes from zero to ; hence the full-step merit change is , which fails the Armijo right side .
Divide the corrected merit change plus by . With , the result is , which tends to as . It is therefore negative for all sufficiently small nonzero , proving the SOC Armijo test passes. The explicit correction norm and residual satisfy the quadratic-size and cubic-residual bounds of [F4].
A quadratic equality model shows the AL conditioning tradeoff
Example
For subject to , the equality augmented Lagrangian with penalty and multiplier has Hessian . Its exact inner minimizer is , and the multiplier update sends to . Thus increasing improves the exact multiplier contraction factor while worsening the inner Hessian condition number to .
Facts & Assumptions
Given: The equality augmented-Lagrangian formula and multiplier update, with fixed .
Finite-budget augmented-Lagrangian multiplier method applies that update after an inner minimization.
An exact inner routine computes this closed-form minimizer and returns success within its finite inner cap ; arithmetic is exact and .
Verification
Substitution into [F1] gives Its Hessian is diagonal with eigenvalues and , so the Euclidean spectral condition number is .
The gradient equations are and ; the unique inner minimizer is . Its constraint value is , so [F1] gives . Its absolute contraction factor is , which decreases as increases while the condition number in step 1.1 increases.