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.

Finite-budget indirect shooting for an interior-control ODE optimality system

Definition

This procedure is restricted to a smooth, unconstrained-interior control branch. Let the smooth data be those of Finite-horizon ODE optimal-control transcription data, with no active path or endpoint constraints apart from the prescribed initial state. Any optional inequality constraints must remain strictly inactive throughout the branch; additional endpoint equalities or active endpoint inequalities require an augmented boundary residual and are outside this procedure. Let H(t,x,p,u)=L(t,x,u)+pTf(t,x,u). Supply a pointwise-defined twice continuously differentiable feedback ψ(t,x,p) on an open tube such that Hu(t,x,p,ψ(t,x,p))=0 and ψ(t,x,p)∈int⁡Uc throughout that tube; differentiability uses the convention of Ck Euclidean maps and diffeomorphisms. Every successful IVP evaluation must keep its trajectory in this tube. If the evaluator cannot certify that condition for a queried trajectory, return inadmissible-interior-branch with no shooting result. Define Hxfix(t,x,p,u):=Dx[L(t,x,u)+pTf(t,x,u)], with the derivative taken holding u fixed, and only then substitute u=ψ(t,x,p). Define z=(x,p)∈R2n and G(t,z)=(f(t,x,ψ(t,x,p))−Hxfix(t,x,p,ψ(t,x,p))),B(zinit,zterm)=(xinit−x0pterm−ϕx(xterm)), where zinit=(xinit,pinit) and zterm=(xterm,pterm). The indirect shooting procedure takes a certified differentiable IVP evaluator for z′=G(t,z), an initial trial z0, residual tolerance τ≥0, and correction cap M∈N0, and calls Finite-budget single shooting for a nonlinear two-point BVP on the square BVP (G,B). It returns that algorithm's trajectory and status without changing the root-tolerance meaning. In particular, root-tolerance-met certifies only the computed boundary residual for the numerical IVP map; it is not an exact BVP, optimality, global-optimality, or discretization-error certificate. If the control is on a boundary or no such smooth feedback is supplied, this procedure is inapplicable.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

19 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