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.
Equality and inequality augmented Lagrangians and multiplier updates
Definition
Use the program, dimensions, gradient conventions, and Lagrangian of Inequality constrained programs, tangent cones, constraint qualifications, and KKT. Let , , and . The equality augmented Lagrangian is For inequalities, with , the projected (Powell–Hestenes–Rockafellar) augmented Lagrangian is After an inner candidate is produced, the multiplier update is The bracket is componentwise. A declared inner stationarity residual is ; an inner procedure must report the residual it achieved or an explicit failure status.
The equality and inequality formulas are distinct branches. For an inequality with , its summand equals ; when , its summand is constant in .
Facts & Assumptions
Given: The program, , equality multiplier , and componentwise nonnegative inequality multiplier .
Inequality constrained programs, tangent cones, constraint qualifications, and KKT uses and the Lagrangian .
The penalty parameter satisfies and the inequality multiplier satisfies .
Proof
For any scalar , the identity when expands to ; when , . This gives the two stated inequality branches and shows they agree in value at their boundary.
Differentiating the equality branch gives multiplier update . On the positive inequality branch, differentiating its summand gives ; on the nonpositive branch it gives zero. Thus the projected update is nonnegative and is consistent with the displayed piecewise gradient.
Depends on
Used by
- Finite-budget augmented-Lagrangian multiplier method Algorithm
- The augmented-Lagrangian multiplier procedure preserves its domain and returns within its caps Corollary
- A quadratic equality model shows the AL conditioning tradeoff Example
- Augmented-Lagrangian multipliers converge locally with summable inner residuals Theorem
Dependency tree · two levels
4 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Jorge Nocedal and Stephen J. Wright, Numerical Optimization, 2nd ed. (standard reference, not scraped)
- Dimitri P. Bertsekas, Constrained Optimization and Lagrange Multiplier Methods (standard reference, not scraped)
- Ralf Herzog, Algorithms and Preconditioning in PDE-Constrained Optimization, lecture notes (standard reference, not scraped)