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.
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.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
9 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)