Alphabeta Math
AlgorithmAlgorithm: Literature-sourcedProof: Not applicablePipeline-generatedprecheck pending
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 residual-merit damped Newton

Definition

Let U⊆Rn be open, n≥1, and let F:U→Rn be C1 (Continuously differentiable maps, local inverses, and local diffeomorphisms) with Jacobian JF as in The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case. The matrix of DF(x) in the standard basis is JF(x) by A total derivative computes every directional derivative, and its matrix is the Jacobian. Define the residual merit Φ(x):=12∥F(x)∥22. Inputs: x0∈U, residual tolerance ε≥0, update budget N∈N0, sufficient-decrease parameter α∈(0,1), reduction factor β∈(0,1), and finite backtrack budget B∈N0. Output: the last valid iterate and one of root, singular-jacobian, invalid-trial, line-search-exhausted, or iteration-budget-exhausted.

At iteration k=0,1,…,N, apply these instructions in order:

  1. Evaluate F(xk). If ∥F(xk)∥2≤ε, return (xk,root). This status records the residual test only.
  2. If k=N, return (xk,iteration-budget-exhausted).
  3. Call Newton correction for a square vector residual with A=JF(xk) and r=F(xk). If it returns singular-jacobian, return (xk,singular-jacobian). Otherwise let sk be its correction.
  4. For j=0,1,…,B, set t=βj and trial y=xk+tsk. If y∉U, reject the trial and continue. If y∈U, evaluate Φ(y) and accept the first trial satisfying Φ(y)≤Φ(xk)−αt∥F(xk)∥22. On acceptance set xk+1=y and continue at iteration k+1.
  5. If no trial was accepted, return (xk,invalid-trial) if every tested point was outside U; otherwise return (xk,line-search-exhausted).

The residual-merit test is defined directly for a vector root problem. A finite backtrack budget can return failure; no global convergence or quadratic-rate claim is made.

Depends on

Used by

Dependency tree · two levels

14 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