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.
Minimum-norm second-order correction for identified active constraints
Definition
Let collect the equality constraints and a specified
set of active inequality constraints, in that order. Given ,
assume has full row rank and the SQP step satisfies
. For , compute
and return as the corrected displacement. If the rank test fails,
the inverse or evaluation fails, return correction-failure. If ,
return with . This is a correction for the specified active
constraints; it does not certify feasibility of inactive constraints.
Remarks
The full-row-rank inverse formula is supplied by If has full row rank, then , and the minimum-norm characterization by For every right-hand side , is the unique least-squares solution of minimum Euclidean norm, with right-hand side . The zero-row branch returns the zero correction. Residual-order estimates under smoothness and uniform rank hypotheses are separate properties.
Depends on
Used by
- L1 merit globalization with finite penalty and backtracking budgets Algorithm
- A full SQP step is rejected by the L1 merit test and repaired by SOC Example
- Finite merit-globalization budgets return a defined status Theorem
- Second-order correction reduces the active constraint residual to cubic order Theorem
Dependency tree · two levels
10 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)