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.
Short-step self-concordant path following with finite failure statuses
Definition
Let be a proper cone, a -log-homogeneous self-concordant barrier on , and consider subject to , . Require the barrier Hessian restricted to to be positive definite, so the affine restriction has a local norm. The local calculus lemma proves that each barrier subproblem has an attained unique center whenever its Newton decrement is below one.
For a strict feasible with , define the restricted local norm by for . The decrement used below is the restricted dual norm Thus is induced by the barrier Hessian restricted to the feasible tangent space.
Inputs: , target , a strictly feasible with restricted decrement , integer caps and , and an exact linear-system solver for the equality-constrained Newton equations. Output: a record with a status and optional iterate fields. gap-tolerance returns the feasible iterate , current , and certified gap bound . outer-cap, centering-cap, and newton-solve-failure return the last feasible iterate and current with no gap certificate. invalid-start returns no iterate and no gap certificate.
- Verify , , the stated initial decrement, and all cap/parameter conditions; otherwise return
invalid-start. Set , , and both counters to zero. - While , first return
outer-capif the outer counter equals . Set and . - At the current , compute . While and the inner counter is below , solve the restricted Newton equation on . If the solve fails, return
newton-solve-failure. Otherwise set , increment the inner counter, and recompute . - If after the inner loop, return
centering-cap. Otherwise accept , increment the outer counter, reset the inner counter, and repeat step 2. - When the loop condition is false, return
gap-tolerancewith , , and bound .
The cap counts Newton corrections, not factorization operations. This definition does not construct a strict feasible start; a Phase-I certificate is a separate input obligation.
Depends on
Used by
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
- Stephen Boyd and Lieven Vandenberghe, Convex Optimization (standard reference, not scraped)
- Hamza Fawzi, Topics in Convex Optimisation, Lecture 15 (standard reference, not scraped)