Alphabeta Math
AlgorithmAlgorithm: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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.

Finite-budget bracketing and zoom for a strong Wolfe step

Definition

Let D⊆Rn be open, let f:D→R be C1, let x∈D, and let p∈Rn be arbitrary. Fix 0<c1<c2<1/2 and finite budgets E,Z∈N for expansion and zoom trials. After the direction check passes, use the functions ϕ(t)=f(x+tp) and ϕ′(t)=⟨∇f(x+tp),p⟩ from Wolfe and strong Wolfe line-search conditions. Output: either a positive strong Wolfe step, or one of invalid-direction, domain-exit, and evaluation-budget-exhausted.

  1. Evaluate and retain f(x) and ∇f(x), and set ϕ(0):=f(x) and ϕ′(0):=⟨∇f(x),p⟩. If ϕ′(0)≥0, return invalid-direction. Set a:=0 and t:=1. For at most E expansion trials, in order:
    • If x+tp∉D, return domain-exit without evaluating the trial.
    • Evaluate ϕ(t) and ϕ′(t). If ϕ(t)>ϕ(0)+c1tϕ′(0) or ϕ(t)≥ϕ(a), call the zoom procedure below with the ordered endpoint pair (a,t) and return its output.
    • If ∣ϕ′(t)∣≤c2∣ϕ′(0)∣, return t as a strong Wolfe step.
    • If ϕ′(t)≥0, call zoom with the reversed endpoint pair (t,a) and return its output.
    • Otherwise set a:=t and t:=2t.
  2. If the expansion budget is exhausted, return evaluation-budget-exhausted.

For zoom(a,b), preserve the endpoint order even when b<a. For at most Z zoom trials, in order:

  1. Set m:=(a+b)/2. If x+mp∉D, return domain-exit without evaluating the trial.
  2. Evaluate ϕ(m) and ϕ′(m). If ϕ(m)>ϕ(0)+c1mϕ′(0) or ϕ(m)≥ϕ(a), set b:=m. Otherwise, if ∣ϕ′(m)∣≤c2∣ϕ′(0)∣, return m as a strong Wolfe step. In the remaining branch, if ϕ′(m)(b−a)≥0, first set b:=a; then set a:=m.
  3. If the zoom budget is exhausted, return evaluation-budget-exhausted.

The procedure returns a step only after both strong Wolfe inequalities have been checked. Finite budgets and domain exits may return failure even when a strong Wolfe step exists; no convergence claim follows from the procedure alone.

Depends on

Used by

Dependency tree · two levels

23 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