Alphabeta Math
AlgorithmAlgorithm: AI-adaptedProof: Not applicablePipeline-generated
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 K be a proper cone, F a ν-log-homogeneous self-concordant barrier on int⁡K, and consider min⁡cTx subject to Ax=b, s=h−Gx∈K. Require the barrier Hessian restricted to ker⁡A 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 x with Ax=b, define the restricted local norm by ∥d∥t,x=D2Φt(x)[d,d] for d∈ker⁡A. The decrement used below is the restricted dual norm λt(x)=sup⁡{∣DΦt(x)[d]∣:d∈ker⁡A, ∥d∥t,x≤1}. Thus λt(x) is induced by the barrier Hessian restricted to the feasible tangent space.

Inputs: t0>0, target ε>0, a strictly feasible x0 with restricted decrement λt0(x0)≤1/4, integer caps Nout≥0 and Nin≥2, 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 x, current t, and certified gap bound (ν+ν/2)/t. outer-cap, centering-cap, and newton-solve-failure return the last feasible iterate and current t with no gap certificate. invalid-start returns no iterate and no gap certificate.

  1. Verify Ax0=b, h−Gx0∈int⁡K, the stated initial decrement, and all cap/parameter conditions; otherwise return invalid-start. Set x=x0, t=t0, and both counters to zero.
  2. While (ν+ν/2)/t>ε, first return outer-cap if the outer counter equals Nout. Set α=1+1/(8ν) and t+=αt.
  3. At the current x, compute λ=λt+(x). While λ>1/4 and the inner counter is below Nin, solve the restricted Newton equation D2Φt+(x)[d,⋅]=−DΦt+(x)[⋅] on ker⁡A. If the solve fails, return newton-solve-failure. Otherwise set x←x+d/(1+λ), increment the inner counter, and recompute λ.
  4. If λ>1/4 after the inner loop, return centering-cap. Otherwise accept t←t+, increment the outer counter, reset the inner counter, and repeat step 2.
  5. When the loop condition is false, return gap-tolerance with x, t, and bound (ν+ν/2)/t.

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