Theorem 4.1, pp. 1720–1721 — local contractivity of the real-time iterations: (4.2), (4.3), (4.4)
ProvedRealTimeIter.Contract.theorem_4_1Consider the shrinking-horizon problems , their Lagrangians and Newton-type matrices , a family of compatible norms , a neighbourhood with projections , an initial state and an initial guess . Assume, for : is twice continuously differentiable on ; is continuous on and has a bounded inverse there; and there are and such that (4.1a), (4.1b) hold for all , , , and (4.1c) holds for :
Suppose the first step is small, , and . Let be the real-time iterates, , , where belongs to and , , and let . Then:
- (4.2) for : ;
- (4.3) for :
and ; 3. (4.4) for : the Newton-type iterates (2.4) of started at converge to a stationary point (), and
The real-time iteration performs a single Newton-type step per problem and then moves to the next, shorter problem. The theorem shows that, after one initial disturbance, its iterates contract like a Newton-type method and approach the exact stationary points of the problems they track, at a geometric rate.
Formalization Note. The hypotheses are bundled in Thm41Hyp (see the definitions file): differentiability, continuity and invertibility are required at the points of , not globally; (4.1a)–(4.1c) are required for those with , since the paper's live on (which need not be convex). is identified as the limit of the Newton-type scheme (2.4) from , as in the paper's proof (p. 1723), so it cannot be chosen after the fact. Since enters linearly, its Hessian and do not depend on (Remark 1).
import Mathlib import Definitions.Def_RealTimeIter_Contract_Problem import Definitions.Def_RealTimeIter_Contract_Iteration
namespace RealTimeIter.Contract
theorem theorem_4_1 (P : OCP) (ν : CompatNorms P) (x0 : Vec P.nx) (y0 : PD P 0)
(D0 : Set (PD P 0)) (κ ω : ℝ) (h : Thm41Hyp P ν x0 y0 D0 κ ω) :
-- (4.2)
(∀ k ≤ P.N, (rti P x0 y0 k).2 ∈ projTo P k '' ball0 P ν x0 y0 κ ω ∧
projTo P k '' ball0 P ν x0 y0 κ ω ⊆ Dset P D0 k) ∧
-- (4.3)
(∀ k < P.N,
ν.nrm (k + 1) (rtiStep P x0 y0 (k + 1))
≤ (κ + ω / 2 * ν.nrm k (rtiStep P x0 y0 k)) * ν.nrm k (rtiStep P x0 y0 k) ∧
delta P ν x0 y0 κ ω k * ν.nrm k (rtiStep P x0 y0 k)
≤ delta P ν x0 y0 κ ω 0 * ν.nrm k (rtiStep P x0 y0 k) ∧
delta P ν x0 y0 κ ω k ≤ delta P ν x0 y0 κ ω 0) ∧
-- (4.4)
(∀ k ≤ P.N, ∃ ystar : PD P k,
Filter.Tendsto (newtonIter P k (rti P x0 y0 k).1 (rti P x0 y0 k).2) Filter.atTop
(nhds ystar) ∧
grad P k (rti P x0 y0 k).1 ystar = 0 ∧
ν.nrm k ((rti P x0 y0 k).2 - ystar)
≤ ν.nrm k (rtiStep P x0 y0 k) / (1 - delta P ν x0 y0 κ ω k) ∧
ν.nrm k (rtiStep P x0 y0 k) / (1 - delta P ν x0 y0 κ ω k)
≤ delta P ν x0 y0 κ ω 0 ^ k * ν.nrm 0 (rtiStep P x0 y0 0)
/ (1 - delta P ν x0 y0 κ ω 0)) := by sorry
end RealTimeIter.Contract
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.