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.
Scaled KKT residual and convex normal cone
Definition
Use the program and dimensions of Inequality constrained programs, tangent cones, constraint qualifications, and KKT. For any , , and , define coordinatewise and the scaled residual
The symbol denotes coordinatewise multiplication. The norm is the Euclidean norm from The Euclidean inner product on , and the norm of the zero-dimensional vector is .
For a convex set and , its (outward) normal cone is
This definition applies in particular when is closed and convex.
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
- Projected contact dynamics and explicit projection Euler step Definition
- The convex normal-cone operator is maximal monotone and its resolvent is projection Lemma
- Convex KKT conditions certify a global minimum and an outward normal Theorem
- Projected-gradient fixed points are normal-cone certificates Theorem
- The scaled KKT residual vanishes exactly at KKT tuples Theorem
Dependency tree · two levels
17 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
- Boyd and Vandenberghe, Convex Optimization (standard reference, not scraped)
- Nocedal and Wright, Numerical Optimization, second edition (standard reference, not scraped)