Horizon-Uniform Sensitivity and Decay of Terminal Reward Perturbations in Discrete-Time Pontryagin Systems

Pyuyi's log

Horizon-Uniform Sensitivity and Decay of Terminal Reward Perturbations in Discrete-Time Pontryagin Systems

We study local stationary solutions of finite-horizon discrete-time Pontryagin systems near a steady extremal. Under regular stationarity, hyperbolicity of the reduced state-costate map, and scaled transversality of the endpoint conditions, the linearized boundary-value problem has a horizon-uniform Green estimate. A weighted-norm contraction argument gives existence, uniqueness, uniform Lipschitz estimates, and pointwise quadratic remainders. For graph boundary conditions, terminal reward perturbations have exponentially small effects on the initial control and the stationary objective gradient; the linear-quadratic case yields exponential convergence of Riccati matrices and initial feedback gains.

Pyuyi Chufeng Huang, Zikang Song ·

Source locked to arXiv:2606.17762v3 · Article source license: CC BY 4.0

Horizon-Uniform Sensitivity and Decay of Terminal Reward Perturbations in Discrete-Time Pontryagin Systems

Pyuyi Chufeng Huang

Zikang Song

17 August 2026

Abstract

We study local stationary solutions of finite-horizon discrete-time Pontryagin systems near a steady extremal. Suppose that the stationarity equation for the control is regular, the reduced state–costate map is hyperbolic, and the endpoint conditions satisfy a scaled transversality condition with respect to the stable and unstable subspaces. Then the linearized boundary-value problem admits an inverse whose Green estimate is uniform in the horizon. The Green kernel separates interior decay from the two reflections induced by the endpoint conditions. For x0=xin and pT=rx(xT,y), a contraction argument in a weighted norm proves existence and uniqueness in a neighborhood independent of T, together with uniform Lipschitz estimates and a pointwise quadratic remainder. We also derive an explicit admissible data radius and an a posteriori criterion for existence and local uniqueness near an approximate trajectory. For these graph boundary conditions, a one-sided Green estimate shows that a perturbation of the terminal reward changes the initial control and the gradient with respect to the initial state of the stationary objective by O(e−αterT) for every αter below the dichotomy rate. For linear-quadratic systems with invertible A, stabilizable (A,B), Q≻0, R≻0, and a nonpositive terminal Hessian, a symplectic graph condition verifies the assumptions, and the finite-horizon Riccati matrix and initial feedback gain converge at rate O(e−2γT). Numerical experiments verify the certificates and the predicted decay rates.

Introduction

Finite-horizon optimal control methods repeatedly solve two-point Pontryagin equations, for example in shooting, continuation, and receding-horizon computations (Bertsekas, 2017; Grüne and Pannek, 2017). A fixed-horizon implicit function theorem gives a local stationary branch, but does not control the inverse uniformly as the horizon grows.

Dichotomy theory relates boundary transversality to well-conditioned linear boundary-value problems (Coppel, 1978). Implicit-function arguments in weighted sequence spaces yield horizon-uniform nonlinear sensitivity once a uniformly bounded linear inverse is available (Grüne et al., 2021). Hyperbolic Hamiltonian equilibria and transverse stable and unstable manifolds also yield two-sided turnpike estimates. For optimal solutions and KKT systems, uniform exponential sensitivity has been proved under second-order sufficient conditions, constraint qualifications, or controllability assumptions. Dynamic programming gives the complementary value-function description of the same optimal trajectories; its differentiable characteristics are the Hamiltonian state–costate equations (Bertsekas, 2017; Sassano, 2025). The correspondence is classical; here it determines when the stationary quantities certified below coincide with value gradients and feedback laws.

First, Na and Anitescu (2020) prove decay of directional sensitivities for locally optimal discrete-time programs under uniform second-order sufficiency, controllability, and derivative bounds, while Shin and Zavala (2021) relate second-order sufficiency and constraint regularity to controllability and observability; we instead use a verifiable transversality condition for a hyperbolic state–costate map to construct a local stationary Pontryagin branch without assuming optimality. Second, Shin et al. (2022) prove that primal–dual sensitivity in graph-structured nonlinear programs decays with graph distance under a strong second-order sufficient condition and the linear independence constraint qualification; for the temporal chain, we separate the contributions of both boundaries and use a scaled boundary matrix to bound the influence of the terminal condition on the initial control and initial costate. Third, Breiten and Pfeiffer (2020) and Kunisch and Pfeiffer (2020) prove exponential receding-horizon estimates for infinite-dimensional linear-quadratic (LQ) problems and stabilization problems with terminal penalties, respectively; we instead bound terminal reward perturbations in a discrete-time nonlinear Pontryagin boundary problem, with optimality required only for its interpretation in optimal control. Fourth, Sakamoto and Zuazua (2021) derive nonlinear turnpike estimates from stable and unstable manifolds, while Xu and Anitescu (2018) prove exponential accuracy of an overlapping temporal decomposition in the overlap size; our framework combines the scaled boundary matrix with a horizon-independent nonlinear existence radius and pointwise quadratic remainder, adds a separate a posteriori existence test, and uses the LQ Möbius representation to obtain the O(e−2γT) bound on sensitivity to the terminal Hessian.

We seek a finite-horizon matrix criterion that controls both endpoint reflections and remains valid for the nonlinear terminal condition pT=rx(xT,y). Our contributions are as follows. First, we derive a Green estimate from the scaled matrices ΓˆT; its kernel separates interior decay from two endpoint reflections. Second, we prove the existence of a horizon-uniform local stationary branch, a pointwise remainder of order O(wT(t)2‖Δ‖2), and a uniform Lipschitz estimate for the initial control. We also derive explicit a priori and a posteriori radii for existence and local uniqueness. Third, for graph boundary conditions, we isolate the contribution of the terminal boundary and prove that perturbations of the terminal reward have exponentially small effects on controls near the initial time and on the gradient of the stationary objective with respect to the initial state. Fourth, for LQ systems with invertible A, stabilizable (A,B), Q≻0, R≻0, and S⪯0, we reduce the matrix criterion to symplectic graph conditions, prove invertibility for every horizon, and obtain an explicit Möbius formula and O(e−2γT) convergence of the Riccati matrices and feedback gains.

The main results establish stationary extremals. An additional second-order sufficient condition is required to identify them as local optima. Section 2 gives the reduction, Section 3 proves the linear estimate, Sections 4–5 give the nonlinear results, decay under terminal reward perturbations, and computable certificates, Section 6 treats the LQ verification, and Section 7 reports the numerical tests.

Model, reduction, and standing assumptions

For a horizon T∈ℕ, the state is in ℝd, the control set U⊂ℝm is compact and convex, and xt+1=F(xt,ut),0≤t<T.(2.1) For y in an open set Y⊂ℝq, the maximization objective and Hamiltonian are JT(u)=r(xT,y)−λ∑t=0T−1ℓ(xt,ut),λ>0,(2.2) H(x,u,p)=−λℓ(x,u)+⟨p,F(x,u)⟩.(2.3)

All local branch estimates use fixed neighborhoods, independent of T. The maps F and ℓ are C3 near the reference, and terminal rewards r(⋅,y) are C3 in x when nonlinear terminal conditions are used. The required uniform derivative bounds are stated below.

An interior stationary reference satisfies x∞=F(x∞,u∞),p∞=Hx(x∞,u∞,p∞),Hu(x∞,u∞,p∞)=0,(2.4) with u∞∈int⁡U.

Pontryagin equations and sign convention

We use the maximization convention for (2.2) and the forward Hamiltonian (2.3); the costate paired with the step from t to t+1 is pt+1. Consequently Hx(x,u,p+)=∂xF(x,u)⊤p+−λ∂xℓ(x,u),Hu(x,u,p+)=∂uF(x,u)⊤p+−λ∂uℓ(x,u). If a trajectory is locally optimal for (2.2), one-sided variations of a single control value in the convex set U give xt+1=F(xt,ut),pt=Hx(xt,ut,pt+1),pT=∂xr(xT,y),⟨Hu(xt,ut,pt+1),v−ut⟩≤0,0≤t<T,v∈U.(2.5) These are the standard discrete-time Pontryagin conditions (Halkin, 1966; Bertsekas, 2017); the signs reflect maximization of terminal reward minus accumulated cost.

All sufficiently small branches considered below remain in int⁡U. On such branches the variational inequality is equivalent to Hu=0. The local stationarity graph constructed next therefore eliminates ut as ut=ν(xt,pt+1) and turns the first two equations in (2.5) into the reduced implicit equation (2.11). The endpoint rows are retained rather than eliminated. Thus a stationary Pontryagin branch in this paper means a local branch of (2.5) after interior stationarity reduction.

Relation to Bellman recursion

For an optimal branch, define Vt,T(x;y)=maxut,…,uT−1⁡{r(xT,y)−λ∑k=tT−1ℓ(xk,uk)},Qt,T(x,u;y)=−λℓ(x,u)+Vt+1,T(F(x,u);y), with VT,T=r. If the relevant value functions are differentiable and the Bellman maximizers are interior, then, along the optimal trajectory, pt+1=DxVt+1,T(xt+1;y),DuQt,T=Hu=0,DxVt,T=Hx=pt.(2.6) These identities follow from the chain rule and the envelope theorem. Thus the costate equals the state gradient of the future value, and the Pontryagin equations are the first-order characteristic equations associated with the differentiable Bellman recursion (Bertsekas, 2017; Sassano, 2025).

The Hamiltonian and the Bellman Q-function are nevertheless different: in general H(x,u,p+)≠Qt,T(x,u;y). If Vt+1,T is twice differentiable, set x+=F(x,u) and p+=DxVt+1,T(x+;y). Then Duu2Qt,T=Huu+Fu⊤Dxx2Vt+1,TFu.(2.7) Consequently, (2.8) below guarantees only that the stationarity equation can be solved locally for u at fixed p+. It does not imply that u maximizes the Bellman Q-function or that the resulting branch is optimal.

Local control elimination. Assume that F and ℓ are C3 near the reference and Hu(x∞,u∞,p∞)=0,det⁡Huu(x∞,u∞,p∞)≠0.(2.8) Put ζ∞=(x∞,p∞). The finite-dimensional implicit function theorem gives neighborhoods Ω of ζ∞ and V⋐int⁡U of u∞, and a unique C2 map ν:Ω→V such that Hu(x,ν(x,p+),p+)=0,ν(x∞,p∞)=u∞.(2.9) After shrinking the neighborhoods, Dν and D2ν are bounded and Dν=−Huu−1(Hux,Hup).(2.10) These are standard consequences of the implicit function theorem; no local maximum property is used.

With zt=(xt,pt), the reduced state-costate step is ℱ(zt,zt+1)=0,(2.11) where ℱ(zt,zt+1)=(xt+1−F(xt,ν(xt,pt+1))pt−Hx(xt,ν(xt,pt+1),pt+1)).(2.12) Let νx=Dxν(x∞,p∞) and νp=Dp+ν(x∞,p∞). In (2.13), Fx,Fu are the derivatives of the original dynamics F at (x∞,u∞) and all Hamiltonian derivatives are evaluated at (x∞,u∞,p∞) and Hxp+ denotes the derivative of Hx with respect to the forward costate argument. For h=(ξ,π) and h+=(ξ+,π+), the linearization is L0h+L1h+ with L0h=(−(Fx+Fuνx)ξπ−(Hxx+Hxuνx)ξ),L1h+=(ξ+−Fuνpπ+−(Hxp++Hxuνp)π+).(2.13)

Uniform local assumptions. Given a product neighborhood Z=Zx×Zp⊂ℝd×ℝd of 0 contained in Ω−ζ∞, set ℱ~(z,z+):=ℱ((x∞,p∞)+z,(x∞,p∞)+z+),z,z+∈Z.(2.14) The reduced state–costate step (2.11) on (x∞,p∞)+Z is ℱ~(z,z+)=0. We fix Z, a convex U0⋐int⁡U, and compact product balls Bx⋐Zx, Bp⋐Zp such that ν maps all mixed arguments (x∞+ξ,p∞+π+) into U0 and, for some constants Mint,Mter, sup(x∞,p∞)+Z⁡‖Dν‖+sup(x∞,p∞)+Z⁡‖D2ν‖≤Mint,sup(z,z+)∈(Bx×Bp)×(Bx×Bp)⁡‖D2ℱ~(z,z+)‖≤Mint. For a reference y∞∈Y, assume that a neighborhood Y0⋐Y satisfies supx∈x∞+Bx, y∈Y0, 1≤j≤3⁡‖Dxjr(x,y)‖≤Mter. The maps y↦rx(x,y) and y↦rxx(x,y) are assumed continuous uniformly in this tube, and locally Lipschitz uniformly in x when joint Lipschitz dependence on (xin,y) is asserted. All radii below are chosen inside this fixed tube. Finally, direct verification from problem data uses det⁡L1≠0,M:=−L1−1L0.(2.15) Thus the linearized interior equation is ht+1=Mht+L1−1ft. The alternative abstract formulation only requires the Green property stated next.

Linear endpoint estimates

The nonlinear argument requires the following uniform inverse estimate.

Definition 1 (Uniform Green property).

Let L:ℝn×ℝn→ℝn be linear and let 𝖡0,𝖡T∈ℝn×n be fixed boundary-row matrices, not necessarily invertible individually. Given constants CG≥1, γ>0, and T0≥1, the triple (L,𝖡0,𝖡T) has the uniform Green property with these constants if, for every T≥T0, every interior forcing f=(f0,…,fT−1), and every boundary datum b∈ℝn, the following two conditions hold:

  1. The linear problem L[ht,ht+1]=ft,0≤t<T,𝖡0h0+𝖡ThT=b.(3.1) has a unique solution h=(h0,…,hT).

  2. With fixed finite-dimensional norms and κT(t,s)=e−γ|t−s|+e−γ(t+T−s)+e−γ(T−t+s),0≤s<T,(3.2) the solution from (WP) satisfies ‖ht‖≤CG[(e−γt+e−γ(T−t))‖b‖+∑s=0T−1κT(t,s)‖fs‖](3.3) for all 0≤t≤T.

When only the property is named, the constants are independent of T.

The last two terms in (3.2) are the finite-horizon boundary reflections. We write ℒTbdb and ℒTforf for the boundary and forcing solutions.

A concrete verification comes from the explicit transition (2.15) and a uniformly invertible scaled boundary matrix.

Theorem 2 (Finite-horizon Green certificate).

Consider, for a horizon N, ht+1=Mht+gt,0≤t<N,𝖡0h0+𝖡ThN=b,(3.4) on ℝn. Suppose M is hyperbolic and let the columns of Vs and Vu be bases of its stable and unstable subspaces, with dim⁡Es+dim⁡Eu=n; write MVs=VsDs and MVu=VuDu, and assume that, for some K≥1 and γ>0, ‖VsDsk‖≤Ke−γk and ‖VuDu−k‖≤Ke−γk for all k≥0. For each horizon define the scaled boundary matrix ΓˆN=[𝖡0Vs+𝖡TVsDsN𝖡0VuDu−N+𝖡TVu],(3.5) where the superscripts are powers, not transposes. If ΓˆN is invertible for every N≥T0 and supN≥T0⁡‖ΓˆN−1‖<∞, then the uniform Green property of Definition 3.1 holds for (3.4), with constants depending only on the dichotomy bounds, the spectral-projector norms, the fixed boundary matrices, and the displayed uniform bound for ΓˆN−1. Moreover, the uniform inverse bound follows if Γˆ∞:=[𝖡0Vs𝖡TVu](3.6) is invertible and, for some cutoff N∗ large enough for the Neumann argument, each matrix ΓˆN with T0≤N<N∗ is invertible.

We say that scaled boundary transversality holds if ΓˆN in (3.5) is invertible for every N≥T0 with supN≥T0⁡‖ΓˆN−1‖<∞. The bases are fixed once and for all: replacing them by a fixed pair VsAs,VuAu right-multiplies ΓˆN by diag⁡(As,Au), so the property is basis independent up to condition numbers, while no N-dependent rescaling is allowed.

Proof. Let V=[Vs Vu], write V−1=(WsWu), and set Πs=VsWs, Πu=VuWu. Every homogeneous solution has the unique form qt=VsDsta+VuDut−Nη. Its boundary equation is ΓˆN(aη)=b, so uniform invertibility gives ‖qt‖≤C(e−γt+e−γ(N−t))‖b‖.(3.7)

For forcing, define pt=∑j<tMt−1−jΠsgj−∑j≥t(M|Eu)t−1−jΠugj. Then pt+1−Mpt=gt and ‖pt‖≤C∑je−γ|t−j|‖gj‖,(3.8)‖p0‖+‖pN‖≤C∑j(e−γj+e−γ(N−j))‖gj‖.(3.9) Correct the boundary residual b−𝖡0p0−𝖡TpN by a homogeneous solution. Multiplying (3.9) by the two factors in (3.7) produces four terms. The products e−γ(t+j) and e−γ(2N−t−j) are bounded by e−γ|t−j|; the other two are e−γ(t+N−j) and e−γ(N−t+j). Together with (3.8), these are exactly the terms in κN(t,j). This proves (3.3). With zero forcing and boundary datum, invertibility of ΓˆN gives uniqueness.

Finally, ‖ΓˆN−Γˆ∞‖≤Ce−γN. Neumann’s lemma covers all sufficiently large N, and the finitely many remaining inverses give one uniform bound. ◻

This scaled boundary transversality property is also open: under sufficiently small continuous perturbations of M,𝖡0,𝖡T, the Riesz projectors and local bases vary continuously, a common spectral gap persists, and ΓˆN→Γˆ∞ uniformly. Neumann’s lemma covers large N, while continuity of the finitely many remaining least singular values covers short horizons. Any exponential rate below the stable and unstable spectral separation is admissible after increasing K.

The two-sided kernel above is needed for general endpoint data. For Pontryagin graph rows, terminal-only data admit a sharper, one-sided estimate. Write Px=(I0) and RS=(−SI) on ℝd×ℝd.

Lemma 3 (One-sided terminal Green estimate).

In Theorem 3.2, let n=2d, dim⁡Es=dim⁡Eu=d, and write Vs=(XsPs) and Vu=(XuPu). Let 𝒮 be a bounded set of matrices for which Xs is nonsingular and ΓˆT(S)=(XsXuDu−T(Ps−SXs)DsTPu−SXu)(3.10) has a uniformly bounded inverse for S∈𝒮 and T≥T0. For 0<αter<γ, put vT(t)=e−αter(T−t). The solution of ht+1=Mht+gt,Pxh0=0,RShT=bT(3.11) satisfies max0≤t≤T⁡‖ht‖vT(t)≤C→(‖bT‖+max0≤s<T⁡‖gs‖vT(s+1)),(3.12) where C→ is independent of (S,T).

Proof. In the dichotomy representation, the boundary system is (3.10)(a,η)⊤=(bL,bR)⊤, where, for G=maxj⁡‖gj‖/vT(j+1), bL=PxVu∑j<TDu−1−jWugj,bR=bT−RSVs∑j<TDsT−1−jWsgj. Geometric sums give bL=O(vT(0)G) and bR=O(‖bT‖+G). Uniform inversion bounds η; the first row and Xs−1 then give the extra estimate a=O(vT(0)(‖bT‖+G)). Substitution uses the summable ratios e−(γ+αter)k and e−(γ−αter)k, proving the claim. ◻

The following quantitative row-perturbation result will be used for the parameter-dependent terminal Hessian in Section 5.

Lemma 4 (Quantitative perturbation of endpoint rows).

Suppose that (L,𝖡0,𝖡T) has the uniform Green property with constants (CG,γ,T0). All induced operator norms below use the fixed finite-dimensional norms of Definition 3.1. For endpoint-row perturbations E0,ET, put ε=‖E0‖+‖ET‖,ϑ=2CGε.(3.13) If ϑ<1, then (L,𝖡0+E0,𝖡T+ET) has the same Green exponent and initial horizon, with the common admissible constant CGpert=CG1+ϑ1−ϑ.(3.14) The conclusion is uniform whenever ϑ is bounded above by a fixed number smaller than one.

Proof. Use the unperturbed inverse to write the perturbed problem as h=ℒTforf+ℒTbd(b−E0h0−EThT).(3.15) Because max0≤t≤T⁡‖(ℒTbdc)t‖≤2CG‖c‖, its right-hand side is a contraction with factor ϑ, proving existence. Set m=max⁡{‖h0‖,‖hT‖},F∂(f)=∑s=0T−1(e−γs+e−γ(T−s))‖fs‖. At t=0,T, the boundary factor and the Green kernel are bounded by twice the corresponding terms in ‖b‖+F∂(f). Hence m≤2CG(‖b‖+F∂(f)+εm)≤2CG1−ϑ(‖b‖+F∂(f)).(3.16) Writing dT(t)=e−γt+e−γ(T−t), direct multiplication gives dT(t)(e−γs+e−γ(T−s))≤2κT(t,s).(3.17) Indeed, the cross-products are the two reflected kernels, whereas each of the other products is bounded by e−γ|t−s|. Substitution of (3.16) into the original pointwise Green estimate yields ‖ht‖≤CG1−ϑdT(t)‖b‖+CG(1+ϑ)1−ϑ∑s=0T−1κT(t,s)‖fs‖, and hence Definition 3.1 with (3.14). For homogeneous data, (3.16) gives h0=hT=0, and unperturbed well-posedness then gives h=0; thus the perturbed problem is well posed. ◻

Nonlinear reconstruction in weighted spaces

The nonlinear fixed-point argument uses endpoint weights matched to the Green kernel. For 0<α<γ/2, set wT(t)=e−αt+e−α(T−t).(4.1) For each horizon define the weighted space XT={z=(z0,…,zT):‖z‖w,T<∞},‖z‖w,T=sup0≤t≤T⁡‖zt‖wT(t). All differentiability statements below concern the family of maps into these horizon-dependent spaces uniformly in T.

Weighted convolution. If 0<α<γ/2, then there is a constant Cconv, independent of T and t, such that ∑s=0T−1κT(t,s)wT(s)2≤CconvwT(t)2. Moreover e−γt+e−γ(T−t)≤CconvwT(t)2, with κT from (3.2). For example, with q−=e−(γ−2α) and q+=e−(γ+2α), one may use the explicit value Cconv=4(11−q−+q+1−q+).(4.2) To verify this value, put χs−=e−αs, χs+=e−α(T−s), and define Aγ,α=11−q−+q+1−q+. Set κTref(t,s)=e−γ(t+T−s)+e−γ(T−t+s). Since wT(s)2≤2((χs−)2+(χs+)2), splitting the interior sum at s=t gives the two geometric ratios q− and q+ and hence ∑s=0T−1e−γ|t−s|wT(s)2≤2Aγ,α((χt−)2+(χt+)2),(4.3)∑s=0T−1κTref(t,s)wT(s)2≤2Aγ,α((χt−)2+(χt+)2).(4.4) For the reflected kernels, the coefficients of (χt−)2 are q+/(1−q+) and 1/(1−q−); those of (χt+)2 are q−/(1−q−) and 1/(1−q+). Both pairs sum to Aγ,α. Because (χt−)2+(χt+)2≤wT(t)2, the two estimates prove (4.2). Moreover, γ>2α implies e−γt+e−γ(T−t)≤(χt−)2+(χt+)2≤wT(t)2. Thus the same squared weight controls the interior and endpoint remainders.

Quadratic residual. Let ℱ be C2 near (0,0), assume ℱ(0,0)=0, and let L=Dℱ(0,0). Define N(a,b)=ℱ(a,b)−L(a,b). After shrinking the neighborhood, there is a constant CN such that ‖N(a,b)‖≤CN(‖a‖+‖b‖)2 and ‖N(a,b)−N(a~,b~)‖≤CN(‖a‖+‖b‖+‖a~‖+‖b~‖)×(‖a−a~‖+‖b−b~‖). Both estimates follow directly from Taylor’s formula with integral remainder on a fixed convex neighborhood.

We now combine the inverse estimate, the convolution bound, and the residual estimate. Affine endpoint rows are included as the case with zero remainder.

Theorem 5 (Uniform reconstruction with smooth endpoint rows).

Let ℱ:ℝn×ℝn→ℝn be C2 near (0,0), satisfy ℱ(0,0)=0, and have the quadratic residual bounds above. Assume that its linearized equation with rows (𝖡0,𝖡T) satisfies Definition 3.1 with exponent γ. Fix 0<α<γ/2. Let ℬ:ℝn×ℝn→ℝn be C2 near the origin, with bounded second derivative, and satisfy ℬ(0,0)=0 and Dℬ(0,0)[a,b]=𝖡0a+𝖡Tb (the affine row is allowed). Put RB(a,b)=ℬ(a,b)−𝖡0a−𝖡Tb and choose CB such that ‖RB(a,b)‖≤CB(‖a‖+‖b‖)2,(4.5)‖RB(a,b)−RB(a~,b~)‖≤CBΣ(‖a−a~‖+‖b−b~‖),(4.6) where Σ=‖a‖+‖b‖+‖a~‖+‖b~‖.

Let CN be the interior residual constant above, set c=CG, and let a=2CGCconvCN(1+eα)2+16CGCB.(4.7) Choose any R∗>0 such that the weighted ball of radius R∗ lies in the fixed smoothness tube and 2aR∗<1, and define δ∗:=R∗−aR∗2c.(4.8) Then, for T≥T0 and d:=‖Δ‖<δ∗, the problem ℱ(zt,zt+1)=0,ℬ(z0,zT)=Δ(4.9) has a solution in the explicitly computable ball ‖z‖w,T≤R−(d):=1−1−4acd2a<R∗,(4.10) where, if a=0, the continuous convention is R−(d)=cd. It is the only solution in ‖z‖w,T≤R∗. With zlin(Δ):=ℒTbdΔ and Et(Δ):=zt(Δ)−ztlin(Δ), uniformly in T, ‖zt(Δ)‖≤CwT(t)‖Δ‖+CwT(t)2‖Δ‖2,(4.11)‖Et(Δ)‖≤CwT(t)2‖Δ‖2.(4.12)‖zt(Δ1)−zt(Δ2)‖≤CwT(t)‖Δ1−Δ2‖.(4.13) Moreover, ‖Et(Δ1)−Et(Δ2)‖≤CwT(t)2(‖Δ1‖+‖Δ2‖)×‖Δ1−Δ2‖.(4.14) Consequently the solution family is Fréchet differentiable at 0 uniformly in T, with derivative ℒTbd.

Proof. Let 𝒜T denote the linear interior and boundary operator, and let 𝒩T(z) collect N(zt,zt+1) and RB(z0,zT). The Green estimate, wT(t+1)≤eαwT(t), and the weighted convolution give ‖𝒜T−1𝒩T(z)‖w,T≤a‖z‖w,T2,(4.15)‖𝒜T−1(𝒩T(z)−𝒩T(z~))‖w,T≤a(‖z‖w,T+‖z~‖w,T)×‖z−z~‖w,T.(4.16) Indeed, the interior contribution is bounded by the first term in (4.7). At the endpoints wT(0),wT(T)≤2, so the two factors in (4.6) are at most 4(‖z‖w,T+‖z~‖w,T) and 4‖z−z~‖w,T; this gives the second term in (4.7).

Define ΦT(z)=ℒTbdΔ−𝒜T−1𝒩T(z). Since ‖ℒTbdΔ‖w,T≤cd, (4.15) shows that the ball of radius R−(d) is invariant: cd+aR−2=R−. Equation (4.16) gives contraction factor 2aR−<1. Banach’s theorem proves existence. If z,z~ are any two solutions in the ball of radius R∗, then ‖z−z~‖w,T≤2aR∗‖z−z~‖w,T, so they coincide. This proves the computable radius and uniqueness claims.

Subtracting zlin from the fixed-point equation leaves the quadratic interior and endpoint residuals. The sharper convolution estimate for wT2 and e−γt+e−γ(T−t)≤CwT(t)2 give (4.12) and then (4.11). For two data Δ1,Δ2 with di:=‖Δi‖<δ∗, write Ri=R−(di),q12=a(R1+R2)<1. Subtracting the fixed-point equations and applying (4.16) gives ‖z1−z2‖w,T≤c1−q12‖Δ1−Δ2‖.(4.17) For the pointwise remainder difference, set a‾=CGCconvCN(1+eα)2+16CGCB≤a.(4.18) The interior residual difference is at most CN(1+eα)2wT(s)2(R1+R2)‖z1−z2‖w,T, and (4.6), together with wT(0),wT(T)≤2, gives the boundary bound 16CB(R1+R2)‖z1−z2‖w,T. The estimates for wT2 therefore yield ‖Et(Δ1)−Et(Δ2)‖≤a‾c(R1+R2)1−q12wT(t)2‖Δ1−Δ2‖.(4.19) Since Ri=cdi+aRi2 and aRi<aR∗<1/2, Ri≤2cdi and q12≤2aR∗. Consequently (4.13) and (4.14) hold with CLip=c1−2aR∗,Crem=2a‾c21−2aR∗.(4.20) All constants depend only on the displayed uniform bounds, not on T. ◻

The restriction α<γ/2 is needed for the remainder with weight wT2. Existence, size, and Lipschitz continuity alone hold for every 0<α<γ by the corresponding convolution estimate for wT.

Application to Pontryagin boundary conditions

We now apply Theorem 4.1 directly to the reduced Pontryagin equation and its nonlinear terminal condition.

Theorem 6 (Uniform local Pontryagin branch with a nonlinear terminal condition).

Assume the local hypotheses of Section 2, including (2.8), and let y∞∈Y satisfy p∞=rx(x∞,y∞). For y near y∞ define ℬy(z0,zT)=(ξ0πT−(rx(x∞+ξT,y)−rx(x∞,y))),Δoc(xin,y)=(xin−x∞rx(x∞,y)−p∞), where z=(ξ,π)=(x−x∞,p−p∞)∈ℝ2d. Then ℬy(z0,zT)=Δoc(xin,y) is equivalent to x0=xin,pT=rx(xT,y). If the rows Dℬy∞(0,0) satisfy Definition 3.1 with constants (CG,γ,T0), choose a relatively compact neighborhood Y1⋐Y0. With ET(y)=(00−[rxx(x∞,y)−rxx(x∞,y∞)]0), shrink Y1 so that ϑ‾:=2CGsupy∈Y1⁡‖ET(y)‖<1.(5.1) Then Lemma 3.4 gives the common Green constant C‾G=CG1+ϑ‾1−ϑ‾.(5.2) Set CB=Mter in (4.5)–(4.6), define the common constants a,c from (4.7) using C‾G, and choose one pair R∗,δ∗ as in (4.8). Then, for every T≥T0 and every (xin,y) satisfying d:=‖Δoc(xin,y)‖<δ∗, the problem admits a unique local stationary Pontryagin branch in the fixed ball ‖z‖w,T≤R∗. Its radius is bounded by (4.10), uniformly in T and y.

For fixed y, let zT,ylin=(ξlin,πlin) be the linear branch formed with Dℬy(0,0), and put utlin=Dν(x∞,p∞)[ξtlin,πt+1lin]. Uniformly for 0≤t<T, ‖zt‖+‖ut−u∞‖≤CwT(t)d,(5.3)‖zt−zT,y,tlin‖+‖(ut−u∞)−utlin‖≤CwT(t)2d2.(5.4) For two branches with the same y, ‖zt1−zt2‖+‖ut1−ut2‖≤CwT(t)‖Δoc1−Δoc2‖.(5.5) The z-estimates also hold at t=T. The expansion is with respect to the combined boundary datum Δoc; at fixed y it is an expansion at xin=x∞ only when rx(x∞,y)=p∞.

If, in addition, y↦rx(x,y) and y↦rxx(x,y) are locally Lipschitz uniformly in x on the terminal tube, then the branch is jointly locally Lipschitz in (xin,y) on this neighborhood of the endpoint data.

The Green hypothesis is verified directly from problem data if (2.15) holds, M is hyperbolic, and the matrices ΓˆT for Dℬy∞(0,0) satisfy the finite-horizon certificate of Theorem 3.2.

Proof. The boundary identity is immediate from the definitions. Its derivative is Dℬy(0,0)[z0,zT]=(ξ0πT−rxx(x∞,y)ξT). The terminal remainder is −(0∫01[rxx(x∞+θξT,y)−rxx(x∞,y)]ξTdθ), so the uniform Dx3r bound gives (4.5)–(4.6) with CB=Mter. Continuity of rxx in y permits (5.1). The only endpoint-row perturbation is ET(y); in the standard Euclidean product norm, its norm is the norm of the displayed difference between terminal Hessians. Hence Lemma 3.4 gives (5.2) uniformly on Y1.

Theorem 4.1 now gives the explicit radius, uniqueness, and the estimates for z. Set ut=ν(x∞+ξt,p∞+πt+1). The fixed tube keeps these controls in int⁡U, and (2.9) recovers the full stationary Pontryagin equations. Taylor’s formula for ν, together with wT(t+1)≤eαwT(t), transfers the size, remainder, and Lipschitz estimates to u.

For two parameters y1,y2, subtract the interior and boundary equations. The additional terms contain rx(⋅,y1)−rx(⋅,y2) and rxx(⋅,y1)−rxx(⋅,y2). On an endpoint ball of radius ε, the uniform Lipschitz bounds and the common Green estimate give ‖z1−z2‖w,T≤C‖xin1−xin2‖+C‖y1−y2‖+Cε‖z1−z2‖w,T.(5.6) The constant is horizon independent by (5.2). Shrinking the fixed neighborhood of the endpoint data until Cε<1/2 absorbs the last term and proves the joint assertion. The final statement in terms of the problem data is Theorem 3.2 applied to M=−L1−1L0. ◻

Proposition 7 (A posteriori existence and local uniqueness certificate).

Let ℛT,Δ be the full interior and boundary residual of (4.9), obtained by stacking the T interior residuals and the boundary residual in ℝn(T+1). Equip the trajectory space XT with a chosen norm ‖⋅‖X; this may be ‖⋅‖w,T, while Section 7 uses the ordinary vector infinity norm. Let z‾ be an approximate solution and put J=DℛT,Δ(z‾). Suppose J is invertible and define β=‖J−1ℛT,Δ(z‾)‖X.(5.7) Assume that, whenever z and z~ are in ‖⋅−z‾‖X≤Rtube, ‖J−1(DℛT,Δ(z)−DℛT,Δ(z~))‖ℒ(XT)≤ω‖z−z~‖X.(5.8) If 2ωβ<1 and r−:=1−1−2ωβω<Rtube,(5.9) then an exact solution exists in ‖z−z‾‖X≤r−. For every r−<R<min⁡{Rtube,1/ω}, it is the unique zero in ‖z−z‾‖X<R. For ω=0, use the conventions r−=β and 1/ω=+∞.

Proof. The frozen-Newton map Ψ(z)=z−J−1ℛT,Δ(z) satisfies ‖Ψ(z‾+h)−z‾‖X≤β+12ω‖h‖X2,‖DΨ(z‾+h)‖ℒ(XT)≤ω‖h‖X. Equation (5.9) is the smaller root of β+ωr2/2=r and obeys ωr−<1. Banach’s theorem proves existence and uniqueness in the smaller ball. On any larger ball with ωr<1, two zeros would be two fixed points of a strict contraction; hence the computed zero is the only one there. ◻

All quantities in Proposition 5.2 are finite-dimensional and computable. Double-precision evaluation is a diagnostic; a formal computer-assisted certificate requires outward-rounded interval bounds for β and ω.

Corollary 8 (Uniform sensitivity of the initial control).

Under the hypotheses of Theorem 5.1, define 𝖪T(xin,y):=u0(xin,y), the first control of the local stationary branch. After possibly shrinking the neighborhood of the endpoint data, there is a constant L independent of (T,y) such that, for every fixed admissible y, every T≥T0, and every two admissible initial states x1,x2, ‖𝖪T(x1,y)−𝖪T(x2,y)‖≤L‖x1−x2‖. If the final Lipschitz assumption of Theorem 5.1 holds, then for arbitrary admissible (x1,y1) and (x2,y2), ‖𝖪T(x1,y1)−𝖪T(x2,y2)‖≤L‖x1−x2‖+L‖y1−y2‖. Moreover, for each fixed y, set Δoc=Δoc(xin,y). With zT,ylin(Δoc)=(ξlin,πlin) denoting the linearized branch formed with Dℬy(0,0), 𝖪T(xin,y)=u∞+Dν(x∞,p∞)[ξ0lin,π1lin]+O(‖Δoc(xin,y)‖2), with a constant independent of (T,y). This expansion treats the initial and terminal boundary data jointly, subject to the qualification stated after (5.5).

Proof. Take t=0 in (5.5) and (5.4), and use wT(0)≤2. The joint estimate follows from the last part of Theorem 5.1. ◻

Proposition 9 (Stationary objective and gradient with respect to the initial state).

For the branch of Theorem 5.1, define the objective evaluated along the stationary branch by 𝒮T(x,y)=r(xT(x,y),y)−λ∑t=0T−1ℓ(xt(x,y),ut(x,y)).(5.10) After shrinking the data neighborhood, the branch is C1 in x for each fixed admissible y, and Dx𝒮T(x,y)=p0(x,y),Lip⁡(Dx𝒮T)≤C,(5.11) with C independent of T for fixed admissible y. If the stationary branch is the unique maximizer in the specified tube, then 𝒮T is the corresponding local value function and 𝖪T is its initial optimal feedback map. Otherwise, they describe only the objective value and initial control associated with a stationary branch.

Proof. Finite-dimensional implicit differentiation applies for each T; the common inverse bounds give the stated uniform estimates. For a variation of x0, stationarity, the costate equation, and pT=rx give Dx𝒮Th=pT⊤δxT−λ∑t(ℓx⊤δxt+ℓu⊤δut)=pT⊤δxT+∑t(pt⊤δxt−pt+1⊤δxt+1)=p0⊤h. Equation (5.5) at t=0 proves the C1,1 bound. At the reference point (x,y)=(x∞,y∞), (5.4) also yields a horizon-uniform quadratic expansion of p0, and hence a cubic remainder for 𝒮T. ◻

Theorem 10 (Exponential decay of sensitivity to the terminal reward).

Assume the explicit hyperbolic transition (2.15) and the graph certificate of Lemma 3.3 at a reference terminal Hessian S⋆. Let 𝒳 be a convex terminal-state neighborhood of x∞ and let ℛ be a class of terminal rewards with a uniform C3 bound. Fix 0<αter<γ and assume supρ∈ℛ⁡supx∈𝒳⁡‖D2ρ(x)−S⋆‖≤η.(5.12) Put GΓ=supT≥T0⁡‖ΓˆT(S⋆)−1‖,CX=supT≥T0⁡‖[XsDsTXu]‖,GΓCXη<1. Let C→ be the resulting common constant in Lemma 3.3, and let CN be a common residual constant in Theorem 4.1. Assume that common branch and data radii R and δ∗ have been chosen so that θ:=8C→‖L1−1‖CN(1+e−αter)R<1.(5.13) Assume also that the initial-state neighborhood and ℛ satisfy dρ(x)=‖(x−x∞,Dρ(x∞)−p∞)‖<δ∗ and the resulting terminal states lie in 𝒳. Then Theorem 4.1, applied to each endpoint map, gives local branches on the same neighborhood. For the same admissible initial state, every ρ,ρ~∈ℛ, T≥T0, and 0≤t<T, ‖ztρ−ztρ~‖+‖utρ−utρ~‖≤Ctere−αter(T−t)‖D(ρ−ρ~)‖L∞(𝒳).(5.14) In particular,  ‖𝖪Tρ(x)−𝖪Tρ~(x)‖≤Ctere−αterT‖ρ−ρ~‖C2(𝒳) .(5.15) The gradients with respect to the initial state in (5.11) obey the same e−αterT bound. The constants are horizon independent for every fixed 0<αter<γ.

Proof. The perturbation of (3.10) caused by S−S⋆ is confined to its lower row and has norm at most CXη. Neumann’s lemma therefore gives the uniform inverse bound GΓ/(1−GΓCXη) and hence one common C→.

Set h=zρ−zρ~ and ΣT=∫01D2ρ(xTρ~+s(xTρ−xTρ~))ds. Subtracting the boundary conditions gives Pxh0=0,RΣThT=D(ρ−ρ~)(xTρ~)=:bT.(5.16) Writing ℱ~=L+N, the interior difference becomes ht+1=Mht+gt, where gt=−L1−1{N(ztρ,zt+1ρ)−N(ztρ~,zt+1ρ~)}. If H=maxt⁡‖ht‖/vT(t), the residual Lipschitz bound, wT≤2, and vT(t)=e−αtervT(t+1) imply maxt⁡‖gt‖vT(t+1)≤8‖L1−1‖CN(1+e−αter)RH. Lemma 3.3 and (5.13) now give H≤C→‖D(ρ−ρ~)‖∞+θH. Thus Cz=C→/(1−θ) controls the state–costate difference, and Cter=Cz[1+Lν(1+eαter)] is admissible, where Lν=sup⁡‖Dν‖. Indeed, the control estimate follows from ut=ν(xt,pt+1); at t=0, the common initial state and vT(1)=eαtere−αterT give (5.15). The gradient estimate follows from (5.11). ◻

Verification for definite linear-quadratic systems

After absorbing the positive multiplier λ into Q and R, consider the LQ dynamics xt+1=Axt+But with running term −12xt⊤Qxt−12ut⊤Rut, Q⪰0, R≻0. The Hamiltonian stationarity equation is ut=R−1B⊤pt+1 and the state–costate equations are xt+1=Axt+BR−1B⊤pt+1,pt=A⊤pt+1−Qxt.(6.1) Assume A is invertible, put G=BR−1B⊤, and eliminate pt+1 to obtain M(A,B,Q,R)=(A+GA−⊤QGA−⊤A−⊤QA−⊤).(6.2) Then (xt+1pt+1)=M(A,B,Q,R)(xtpt), and let 𝕁=(0I−I0). The factorization M=(IG0I)(A00A−⊤)(I0QI) consists of symplectic factors, hence M⊤𝕁M=𝕁 and the spectrum is reciprocal (Bittanti et al., 1991).

Proposition 11 (Symplectic graph transversality).

Let M∈Sp(2d,ℝ) be hyperbolic. Write bases of its stable and unstable subspaces as Vs=(XsPs),Vu=(XuPu),MVs=VsDs,MVu=VuDu. For S=S⊤, consider the endpoint rows 𝖡0=(I000),𝖡T=(00−SI),(6.3) which impose x0=ξ and pT−SxT=π. The subspaces Es,Eu are Lagrangian, and Γˆ∞=[𝖡0Vs𝖡TVu]=(Xs00Pu−SXu).(6.4) The two blocks are nonsingular exactly when Es∩({0}×ℝd)={0},Eu∩{(x,Sx):x∈ℝd}={0}.(6.5) Under these graph conditions, the uniform Green property holds for all sufficiently large horizons. For a prescribed T0, it holds for every T≥T0 if the finitely many scaled matrices ΓˆT below a large-horizon cutoff are also nonsingular. The conclusions are open under small perturbations of (M,S) within the hyperbolic symplectic region. The large-horizon conclusion is uniform on compact subsets satisfying the two graph conditions. Uniformity from a prescribed T0 additionally requires the finitely many short-horizon matrices to remain nonsingular on the compact set.

Proof. For v,w∈Es, symplecticity gives v⊤𝕁w=(Mkv)⊤𝕁(Mkw)⟶0(k→∞). Thus Es is isotropic. Reciprocal spectral symmetry gives dim⁡Es=dim⁡Eu=d, so Es is Lagrangian; applying the same argument to M−k on Eu proves the unstable assertion. Direct multiplication by (6.3) gives (6.4), and the two kernel conditions are precisely (6.5).

Moreover, ‖ΓˆT−Γˆ∞‖≤Ce−γT. If the diagonal blocks in (6.4) are nonsingular, Neumann’s lemma gives a uniform inverse for all sufficiently large T; Theorem 3.2 then gives the Green property. The finitely many shorter horizons are covered by their assumed nonsingularity. Continuity of hyperbolic spectral projectors and the two graph blocks proves openness and uniformity on compact subsets for the large-horizon conclusion. For fixed T0, continuity of the finitely many remaining singular values gives the corresponding assertion for every T≥T0. ◻

Recall that (A,B) is stabilizable if rank⁡[A−λI  B]=d for every |λ|≥1. Along every complex solution of (6.1), direct substitution gives the energy identity pt+1∗xt+1−pt∗xt=pt+1∗Gpt+1+xt∗Qxt,G=BR−1B⊤.(6.6)

Theorem 12 (Stabilizable definite LQ data).

Let A be invertible, Q=Q⊤≻0, R=R⊤≻0, and let (A,B) be stabilizable. Then M(A,B,Q,R) is hyperbolic, Xs is invertible, and for every S=S⊤⪯0 the block Pu−SXu is invertible. The rows x0=ξ,pT−SxT=π satisfy the uniform Green property for every T≥1. The constants can be chosen uniformly on compact subsets of this data class.

Proof. If Mz=λz with |λ|=1, the left side of (6.6) vanishes along λtz. Hence x=0 and B⊤p=0. The second block equation gives A⊤p=λ−1p, contradicting the PBH condition unless p=0. Thus M is hyperbolic.

If (0,p)∈Es, sum (6.6) forward to infinity. Exponential decay makes both endpoint pairings vanish, hence xt=0 and B⊤pt=0. Here pt+1=A−⊤pt. If p≠0, then V=span⁡{pt:t≥1} is nonzero and invariant under A−⊤. Since A−⊤ is injective, A−⊤V=V, so V is also A⊤-invariant. The powers of A−⊤|V converge to zero, hence A⊤|V has an eigenvalue of modulus greater than one. Its eigenvector is annihilated by B⊤, contradicting the PBH condition. Therefore Xs is invertible.

Let (x0,Sx0)∈Eu with S⪯0. Summing the energy identity from −∞ to −1 gives a nonnegative sum equal to x0⊤Sx0≤0. Thus xt=0 for t≤−1 and Gp0=0; the state equation gives x0=0 and then p0=0. Hence Pu−SXu is invertible. By (6.4) and Theorem 3.2, the Green property holds for all sufficiently large horizons.

For a finite homogeneous problem, x0=0 and pT=SxT. Summing (6.6) gives ∑t=0T−1(pt+1∗Gpt+1+xt∗Qxt)=xT∗SxT≤0. The sum is nonnegative, so both sides vanish. Consequently xt=0, GpT=0, then xT=0, pT=0, and backward recursion gives pt=0. Thus every finite-horizon boundary matrix is invertible. The finitely many matrices below the large-horizon cutoff are absorbed into the uniform bound. Continuous dependence of invariant subspaces and finite-horizon matrices gives compact-subset uniformity. ◻

Corollary 13 (Riccati representation and sensitivity to the terminal Hessian).

Under Theorem 6.2, let the terminal reward be rS(x)=12x⊤Sx with S⪯0. For the unconstrained problem (or where its optimizer is interior), strict concavity makes the stationary branch the unique optimal solution of the Bellman problem, with VTS(x)=12x⊤𝒫T(S)x,𝖪TS(x)=KT(S)x. Fix K≥1 and γ>0 such that, for every k≥0, ‖VsDsk‖≤Ke−γk and ‖VuDu−k‖≤Ke−γk. Put Cs=Ps−SXs,Cu=Pu−SXu,ETRic=Du−TCu−1CsDsT.(6.7) Then 𝒫T(S)=(Ps−PuETRic)(Xs−XuETRic)−1,(6.8)KT(S)=R−1B⊤A−⊤(𝒫T(S)+Q).(6.9) For 𝒫∞=PsXs−1 and K∞=R−1B⊤A−⊤(𝒫∞+Q), ‖𝒫T(S)−𝒫∞‖+‖KT(S)−K∞‖≤Ce−2γT.(6.10) Uniformly for S,S~ in compact subsets of S⪯0, ‖𝒫T(S)−𝒫T(S~)‖+‖KT(S)−KT(S~)‖≤Ce−2γT‖S−S~‖.(6.11) Thus, when two terminal rewards differ only through their Hessians, the induced Riccati matrices and initial gains differ by O(e−2γT). Theorem 5.5 gives the one-sided rate for general terminal-gradient perturbations. The Riccati convergence itself is classical (Caines and Mayne, 1970); here it is derived explicitly from the same scaled graph certificate.

Proof. Strict concavity follows from R≻0, Q⪰0, and S⪯0. Write z0=Vsa+VuDu−Tη and zT=VsDsTa+Vuη. The terminal graph gives CsDsTa+Cuη=0, hence η=−Cu−1CsDsTa; substitution at t=0 proves (6.8). The costate identity p1=A−⊤(p0+Qx0) proves (6.9). The dichotomy gives ‖ETRic‖≤Ce−2γT. Moreover, (Xs−XuETRic)−1 is uniformly bounded: for large T this follows from a Neumann argument around Xs, and the finitely many remaining horizons follow from boundary-value uniqueness (uniformly on the stated compact sets). Therefore 𝒫T−𝒫∞=(𝒫∞Xu−Pu)ETRic(Xs−XuETRic)−1, which proves (6.10). The map S↦Cu−1Cs is uniformly Lipschitz on the stated compact sets, giving (6.11). ◻

Corollary 14 (Nonlinear terminal condition with a nonpositive reference Hessian).

Assume the dynamics and running cost are the LQ data of Theorem 6.2, translated to the stationary reference, and choose a compact U with 0∈int⁡U. If the terminal reward satisfies the hypotheses of Theorem 5.1, with p∞=rx(x∞,y∞) and rxx(x∞,y∞)⪯0, then the original Pontryagin problem x0=xin,pT=rx(xT,y) has the branch, explicit radius, and sensitivity estimates of Theorem 5.1, with T0=1.

Proof. Apply Theorem 6.2 with S=rxx(x∞,y∞), then apply Theorem 5.1. ◻

Numerical illustration

The finite-dimensional computations below evaluate the stated certificates and nonlinear checks. All coordinates in the example are nondimensional. We use the coupled stabilizable data A=(1.50.400.6),B=(10.5),Q=(10.30.30.6),R=1,(7.1) with rectangular input. Here λmin⁡(Q)≈0.439 and ‖[A,Q]‖2≈0.334. Since 1.5 is the only eigenvalue of A with modulus at least one and σmin⁡([A−1.5I  B])≈0.980, the PBH test gives stabilizability, so Theorem 6.2 applies. The matrix (6.2) has eigenvalue moduli {0.367,0.556,1.798,2.723}, spectral gap γ≈0.587, and, for unit-norm eigenvector bases, σmin⁡(Xs)≈0.188 and σmin⁡(Pu)≈0.325. Thus the canonical graph transversality condition holds with an explicit numerical margin. For shifted rows we take Sterm=−(0.80.20.20.5)⪯0, so Theorem 6.2 applies. The nonlinear terminal reward is rnl(x)=12x⊤Stermx−(vterm⊤x)3,vterm=2−1/2(1,1)⊤. Direct evaluation gives λmax⁡(rnl,xx)≤−0.106 on ‖x‖∞≤0.08. For the nonlinear test we perturb the dynamics to F(x,u)=Ax+Bu+0.1φ(x), where φ(x)=(x22,x1x2), and solve in the unit direction proportional to (0,0,−0.95,−0.30). Table 1 reports the scaled Green test, quadratic remainder slopes, boundary conditioning, and the explicit neighborhood and posterior tests. The normalized remainder is Cˆ(T,s)=sup0≤t≤T⁡‖zt−ztlin‖wT(t)2s2,α=0.05<γ/2. Across T=20,40,80,160, the scaled boundary condition number is at most 7.725, whereas a reliable column-norm lower bound for the unscaled matrix reaches 7.56×1069 at T=160. Fits over s∈{3×10−4,10−3,3×10−3,10−2} give remainder slopes between 1.99987 and 2.00713 with R2≥0.999997. The a posteriori test additionally uses s=3×10−2 and s=10−1. To test the decay caused by a terminal reward perturbation, we set rs(x)=rnl(x)+sd⊤x, with d=(−0.95,−0.30)⊤/‖(−0.95,−0.30)‖, and evaluate |u0s−u00|/s. Fits over T=20,25,30,35 for s∈{0.003,0.01,0.03} give rates 0.58706–0.58731 with R2>0.999999, consistent with γ=0.58664. The exact LQ graph calculation for changing the terminal Hessian from 0 to Sterm gives rate 1.17187 with R2>0.999999, consistent with 2γ=1.17328.

For the finite-dimensional residual FT(z;Δ)=LTz−EΔ+NT(z), where NT(0)=DNT(0)=0, we also evaluate an explicit direction-independent Newton–Kantorovich data radius. All operator norms in the following calculation are ordinary trajectory infinity norms. With μT=‖LT−1‖∞, cT=‖LT−1E‖∞, and ‖DNT(z)−DNT(w)‖∞≤K‖z−w‖∞, the condition ‖Δ‖∞<ρT:=12μTKcT(7.2) places the linear predictor in the Kantorovich regime. Indeed, if dTlin=cT‖Δ‖∞ and aT=μTKdTlin<1/2, then a Neumann bound at the linear predictor gives βT≤μTK(dTlin)22(1−aT),ωT≤μTK1−aT,βTωT≤12(aT1−aT)2<12. Thus Proposition 5.2, in the ordinary infinity norm, applies. Using 80% of this open threshold gives uniform evaluated radii 2.10×10−2 for the canonical row and 1.53×10−3 for the nonlinear shifted row over the four tested horizons. These radii are valid for every endpoint direction, unlike the directional sampling. The a posteriori test of Proposition 5.2 succeeds in 44 of 48 runs: all canonical runs and all shifted runs with s≤0.03 pass; the four shifted s=0.1 runs fail the sufficient inequality and lie outside the stated concavity box; they are included only to examine the sufficient test outside the stated concavity range. All shifted runs with s≤0.03 remain inside that box. Failure of the test does not imply nonexistence. At s=10−2, the shifted posterior reported admissible uniqueness radius is approximately 6.14×10−3. These are floating-point contraction checks using inverse-norm bounds with a Neumann correction, not interval-verified computer-assisted proofs.

Table 1 reports the numerical inputs behind the reported radii. Here K is a global infinity-norm Lipschitz bound for the Jacobian of the polynomial residual, so Proposition 5.2 allows Rtube=+∞. Also, ρT∘=ρT in (7.2),ρTeval=0.8ρT∘. Panel (b) reports the directly evaluated posterior quantities βTpost,ωTpost. There r−,T bounds the distance from the linear predictor to an exact zero, while RTrep=12(r−,T+1/ωTpost)(7.3) is one concrete radius strictly inside the admissible uniqueness interval, not a maximal radius. The inverse residual in the displayed rows is below 2.1×10−15. The directional posterior test can succeed outside the smaller direction-independent a priori ball because it is centered at the computed predictor for that particular direction.

The additional sweep S(θ)=Sterm+θI detects the value at which limiting transversality fails, near θ∗≈1.23347; the least singular values there are 4.67×10−16 for Γˆ∞ and 3.86×10−12 for T=20. The terminal perturbation data, remainder slopes, radii, and pass counts are summarized above.

Concluding remarks

The scaled boundary matrix gives a Green estimate that separates both endpoint effects. Its one-sided terminal estimate shows that an error in the terminal reward gradient changes the initial stationary control and the gradient with respect to the initial state by O(e−αterT), with an explicit local constant. The same analysis gives horizon-uniform branches, quadratic remainders, and a priori and a posteriori certificates. For LQ systems with invertible A, stabilizable (A,B), Q≻0, R≻0, and a nonpositive terminal Hessian, the certificate holds from T=1, and sensitivity to that Hessian decays at rate O(e−2γT). Under strict concavity these stationary solutions are Bellman optimal. Establishing horizon-uniform second-order sufficient conditions for the nonlinear problem remains open.

References

  1. D. P. Bertsekas.

    Dynamic Programming and Optimal Control, volume 1.

    Athena Scientific, 4th edition, 2017.

  2. S. Bittanti, A. J. Laub, and J. C. Willems, editors.

    The Riccati Equation.

    Springer, 1991.

    doi:10.1007/978-3-642-58223-3.

  3. T. Breiten and L. Pfeiffer.

    On the turnpike property and the receding-horizon method for linear-quadratic optimal control problems.

    SIAM Journal on Control and Optimization, 58 (2): 1077–1102, 2020.

    doi:10.1137/18M1225811.

  4. P. E. Caines and D. Q. Mayne.

    On the discrete time matrix Riccati equation of optimal control.

    International Journal of Control, 12 (5): 785–794, 1970.

    doi:10.1080/00207177008931892.

  5. W. A. Coppel.

    Dichotomies in Stability Theory.

    Springer, 1978.

    doi:10.1007/BFb0067780.

  6. L. Grüne and J. Pannek.

    Nonlinear Model Predictive Control: Theory and Algorithms.

    Springer, 2nd edition, 2017.

    doi:10.1007/978-3-319-46024-6.

  7. L. Grüne, M. Schaller, and A. Schiela.

    Abstract nonlinear sensitivity and turnpike analysis and an application to semilinear parabolic PDEs.

    ESAIM: Control, Optimisation and Calculus of Variations, 27: 56, 2021.

    doi:10.1051/cocv/2021030.

  8. H. Halkin.

    A maximum principle of the Pontryagin type for systems described by nonlinear difference equations.

    SIAM Journal on Control, 4 (1): 90–111, 1966.

  9. K. Kunisch and L. Pfeiffer.

    The effect of the terminal penalty in receding horizon control for a class of stabilization problems.

    ESAIM: Control, Optimisation and Calculus of Variations, 26: 58, 2020.

    doi:10.1051/cocv/2019037.

  10. S. Na and M. Anitescu.

    Exponential decay in the sensitivity analysis of nonlinear dynamic programming.

    SIAM Journal on Optimization, 30 (2): 1527–1554, 2020.

    doi:10.1137/19M1265065.

  11. N. Sakamoto and E. Zuazua.

    The turnpike property in nonlinear optimal control—a geometric approach.

    Automatica, 134: 109939, 2021.

    doi:10.1016/j.automatica.2021.109939.

  12. M. Sassano.

    Infinite-horizon optimal control of nonlinear discrete-time systems: HJB PDE, Hamiltonian dynamics and invariant manifolds.

    Automatica, 179: 112441, 2025.

    doi:10.1016/j.automatica.2025.112441.

  13. S. Shin and V. M. Zavala.

    Controllability and observability imply exponential decay of sensitivity in dynamic optimization.

    IFAC-PapersOnLine, 54 (6): 179–184, 2021.

    doi:10.1016/j.ifacol.2021.08.542.

  14. S. Shin, M. Anitescu, and V. M. Zavala.

    Exponential decay of sensitivity in graph-structured nonlinear programs.

    SIAM Journal on Optimization, 32 (2): 1156–1183, 2022.

    doi:10.1137/21M1391079.

  15. W. Xu and M. Anitescu.

    Exponentially accurate temporal decomposition for long-horizon linear-quadratic dynamic optimization.

    SIAM Journal on Optimization, 28 (3): 2541–2573, 2018.

    doi:10.1137/16M1081993.

If you enjoyed this, leave a comment~

Views — times

© 2026 Pyuyi @PYUYI'S Home
Powered by theme astro-koharu · Inspired by Shoka