Horizon-Uniform Sensitivity and Decay of Terminal Reward Perturbations in Discrete-Time Pontryagin Systems
17 August 2026
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 and , a contraction argument in a weighted norm proves existence and uniqueness in a neighborhood independent of , 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 for every below the dichotomy rate. For linear-quadratic systems with invertible , stabilizable , , , 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 . 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 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 . Our contributions are as follows. First, we derive a Green estimate from the scaled matrices ; 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 , 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 , stabilizable , , , and , we reduce the matrix criterion to symplectic graph conditions, prove invertibility for every horizon, and obtain an explicit Möbius formula and 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 , the state is in , the control set is compact and convex, and For in an open set , the maximization objective and Hamiltonian are
All local branch estimates use fixed neighborhoods, independent of . The maps and are near the reference, and terminal rewards are in when nonlinear terminal conditions are used. The required uniform derivative bounds are stated below.
An interior stationary reference satisfies with .
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 to is . Consequently If a trajectory is locally optimal for (2.2), one-sided variations of a single control value in the convex set give 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 . On such branches the variational inequality is equivalent to . The local stationarity graph constructed next therefore eliminates as 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 with . If the relevant value functions are differentiable and the Bellman maximizers are interior, then, along the optimal trajectory, 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 -function are nevertheless different: in general . If is twice differentiable, set and . Then Consequently, (2.8) below guarantees only that the stationarity equation can be solved locally for at fixed . It does not imply that maximizes the Bellman -function or that the resulting branch is optimal.
Local control elimination. Assume that and are near the reference and Put . The finite-dimensional implicit function theorem gives neighborhoods of and of , and a unique map such that After shrinking the neighborhoods, and are bounded and These are standard consequences of the implicit function theorem; no local maximum property is used.
With , the reduced state-costate step is where Let and . In (2.13), are the derivatives of the original dynamics at and all Hamiltonian derivatives are evaluated at and denotes the derivative of with respect to the forward costate argument. For and , the linearization is with
Uniform local assumptions. Given a product neighborhood of contained in , set The reduced state–costate step (2.11) on is . We fix , a convex , and compact product balls , such that maps all mixed arguments into and, for some constants , For a reference , assume that a neighborhood satisfies The maps and are assumed continuous uniformly in this tube, and locally Lipschitz uniformly in when joint Lipschitz dependence on is asserted. All radii below are chosen inside this fixed tube. Finally, direct verification from problem data uses Thus the linearized interior equation is . 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 be linear and let be fixed boundary-row matrices, not necessarily invertible individually. Given constants , , and , the triple has the uniform Green property with these constants if, for every , every interior forcing , and every boundary datum , the following two conditions hold:
The linear problem has a unique solution .
With fixed finite-dimensional norms and the solution from (WP) satisfies for all .
When only the property is named, the constants are independent of .
The last two terms in (3.2) are the finite-horizon boundary reflections. We write and 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 , on . Suppose is hyperbolic and let the columns of and be bases of its stable and unstable subspaces, with ; write and , and assume that, for some and , and for all . For each horizon define the scaled boundary matrix where the superscripts are powers, not transposes. If is invertible for every and , 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 . Moreover, the uniform inverse bound follows if is invertible and, for some cutoff large enough for the Neumann argument, each matrix with is invertible.
We say that scaled boundary transversality holds if in (3.5) is invertible for every with . The bases are fixed once and for all: replacing them by a fixed pair right-multiplies by , so the property is basis independent up to condition numbers, while no -dependent rescaling is allowed.
Proof. Let , write , and set , . Every homogeneous solution has the unique form Its boundary equation is , so uniform invertibility gives
For forcing, define Then and Correct the boundary residual by a homogeneous solution. Multiplying (3.9) by the two factors in (3.7) produces four terms. The products and are bounded by ; the other two are and . Together with (3.8), these are exactly the terms in . This proves (3.3). With zero forcing and boundary datum, invertibility of gives uniqueness.
Finally, . Neumann’s lemma covers all sufficiently large , and the finitely many remaining inverses give one uniform bound. ◻
This scaled boundary transversality property is also open: under sufficiently small continuous perturbations of , the Riesz projectors and local bases vary continuously, a common spectral gap persists, and uniformly. Neumann’s lemma covers large , 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 .
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 and on .
Lemma 3 (One-sided terminal Green estimate).
In Theorem 3.2, let , , and write and . Let be a bounded set of matrices for which is nonsingular and has a uniformly bounded inverse for and . For , put . The solution of satisfies where is independent of .
Proof. In the dichotomy representation, the boundary system is (3.10), where, for , Geometric sums give and . Uniform inversion bounds ; the first row and then give the extra estimate . Substitution uses the summable ratios and , 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 has the uniform Green property with constants . All induced operator norms below use the fixed finite-dimensional norms of Definition 3.1. For endpoint-row perturbations , put If , then has the same Green exponent and initial horizon, with the common admissible constant 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 Because , its right-hand side is a contraction with factor , proving existence. Set At , the boundary factor and the Green kernel are bounded by twice the corresponding terms in . Hence Writing , direct multiplication gives Indeed, the cross-products are the two reflected kernels, whereas each of the other products is bounded by . Substitution of (3.16) into the original pointwise Green estimate yields and hence Definition 3.1 with (3.14). For homogeneous data, (3.16) gives , and unperturbed well-posedness then gives ; 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 , set For each horizon define the weighted space All differentiability statements below concern the family of maps into these horizon-dependent spaces uniformly in .
Weighted convolution. If , then there is a constant , independent of and , such that Moreover , with from (3.2). For example, with and , one may use the explicit value To verify this value, put , , and define Set . Since , splitting the interior sum at gives the two geometric ratios and and hence For the reflected kernels, the coefficients of are and ; those of are and . Both pairs sum to . Because , the two estimates prove (4.2). Moreover, implies Thus the same squared weight controls the interior and endpoint remainders.
Quadratic residual. Let be near , assume , and let . Define After shrinking the neighborhood, there is a constant such that and 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 be near , satisfy , and have the quadratic residual bounds above. Assume that its linearized equation with rows satisfies Definition 3.1 with exponent . Fix . Let be near the origin, with bounded second derivative, and satisfy and (the affine row is allowed). Put and choose such that where .
Let be the interior residual constant above, set , and let Choose any such that the weighted ball of radius lies in the fixed smoothness tube and , and define Then, for and , the problem has a solution in the explicitly computable ball where, if , the continuous convention is . It is the only solution in . With and , uniformly in , Moreover, Consequently the solution family is Fréchet differentiable at uniformly in , with derivative .
Proof. Let denote the linear interior and boundary operator, and let collect and . The Green estimate, , and the weighted convolution give Indeed, the interior contribution is bounded by the first term in (4.7). At the endpoints , so the two factors in (4.6) are at most and ; this gives the second term in (4.7).
Define Since , (4.15) shows that the ball of radius is invariant: . Equation (4.16) gives contraction factor . Banach’s theorem proves existence. If are any two solutions in the ball of radius , then so they coincide. This proves the computable radius and uniqueness claims.
Subtracting from the fixed-point equation leaves the quadratic interior and endpoint residuals. The sharper convolution estimate for and give (4.12) and then (4.11). For two data with , write Subtracting the fixed-point equations and applying (4.16) gives For the pointwise remainder difference, set The interior residual difference is at most and (4.6), together with , gives the boundary bound . The estimates for therefore yield Since and , and . Consequently (4.13) and (4.14) hold with All constants depend only on the displayed uniform bounds, not on . ◻
The restriction is needed for the remainder with weight . Existence, size, and Lipschitz continuity alone hold for every by the corresponding convolution estimate for .
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 satisfy . For near define where . Then is equivalent to If the rows satisfy Definition 3.1 with constants , choose a relatively compact neighborhood . With shrink so that Then Lemma 3.4 gives the common Green constant Set in (4.5)–(4.6), define the common constants from (4.7) using , and choose one pair as in (4.8). Then, for every and every satisfying , the problem admits a unique local stationary Pontryagin branch in the fixed ball . Its radius is bounded by (4.10), uniformly in and .
For fixed , let be the linear branch formed with , and put Uniformly for , For two branches with the same , The -estimates also hold at . The expansion is with respect to the combined boundary datum ; at fixed it is an expansion at only when .
If, in addition, and are locally Lipschitz uniformly in on the terminal tube, then the branch is jointly locally Lipschitz in on this neighborhood of the endpoint data.
The Green hypothesis is verified directly from problem data if (2.15) holds, is hyperbolic, and the matrices for satisfy the finite-horizon certificate of Theorem 3.2.
Proof. The boundary identity is immediate from the definitions. Its derivative is The terminal remainder is so the uniform bound gives (4.5)–(4.6) with . Continuity of in permits (5.1). The only endpoint-row perturbation is ; 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 .
Theorem 4.1 now gives the explicit radius, uniqueness, and the estimates for . Set . The fixed tube keeps these controls in , and (2.9) recovers the full stationary Pontryagin equations. Taylor’s formula for , together with , transfers the size, remainder, and Lipschitz estimates to .
For two parameters , subtract the interior and boundary equations. The additional terms contain and . On an endpoint ball of radius , the uniform Lipschitz bounds and the common Green estimate give The constant is horizon independent by (5.2). Shrinking the fixed neighborhood of the endpoint data until absorbs the last term and proves the joint assertion. The final statement in terms of the problem data is Theorem 3.2 applied to . ◻
Proposition 7 (A posteriori existence and local uniqueness certificate).
Let be the full interior and boundary residual of (4.9), obtained by stacking the interior residuals and the boundary residual in . Equip the trajectory space with a chosen norm ; this may be , while Section 7 uses the ordinary vector infinity norm. Let be an approximate solution and put . Suppose is invertible and define Assume that, whenever and are in , If and then an exact solution exists in . For every it is the unique zero in . For , use the conventions and .
Proof. The frozen-Newton map satisfies Equation (5.9) is the smaller root of and obeys . Banach’s theorem proves existence and uniqueness in the smaller ball. On any larger ball with , 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 the first control of the local stationary branch. After possibly shrinking the neighborhood of the endpoint data, there is a constant independent of such that, for every fixed admissible , every , and every two admissible initial states , If the final Lipschitz assumption of Theorem 5.1 holds, then for arbitrary admissible and , Moreover, for each fixed , set . With denoting the linearized branch formed with , with a constant independent of . This expansion treats the initial and terminal boundary data jointly, subject to the qualification stated after (5.5).
Proof. Take in (5.5) and (5.4), and use . 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 After shrinking the data neighborhood, the branch is in for each fixed admissible , and with independent of for fixed admissible . If the stationary branch is the unique maximizer in the specified tube, then is the corresponding local value function and 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 ; the common inverse bounds give the stated uniform estimates. For a variation of , stationarity, the costate equation, and give Equation (5.5) at proves the bound. At the reference point , (5.4) also yields a horizon-uniform quadratic expansion of , and hence a cubic remainder for . ◻
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 . Let be a convex terminal-state neighborhood of and let be a class of terminal rewards with a uniform bound. Fix and assume Put Let be the resulting common constant in Lemma 3.3, and let be a common residual constant in Theorem 4.1. Assume that common branch and data radii and have been chosen so that Assume also that the initial-state neighborhood and satisfy 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 , , and , In particular, The gradients with respect to the initial state in (5.11) obey the same bound. The constants are horizon independent for every fixed .
Proof. The perturbation of (3.10) caused by is confined to its lower row and has norm at most . Neumann’s lemma therefore gives the uniform inverse bound and hence one common .
Set and Subtracting the boundary conditions gives Writing , the interior difference becomes , where If , the residual Lipschitz bound, , and imply Lemma 3.3 and (5.13) now give . Thus controls the state–costate difference, and is admissible, where . Indeed, the control estimate follows from ; at , the common initial state and give (5.15). The gradient estimate follows from (5.11). ◻
Verification for definite linear-quadratic systems
After absorbing the positive multiplier into and , consider the LQ dynamics with running term , , . The Hamiltonian stationarity equation is and the state–costate equations are Assume is invertible, put , and eliminate to obtain Then , and let . The factorization consists of symplectic factors, hence and the spectrum is reciprocal (Bittanti et al., 1991).
Proposition 11 (Symplectic graph transversality).
Let be hyperbolic. Write bases of its stable and unstable subspaces as For , consider the endpoint rows which impose and . The subspaces are Lagrangian, and The two blocks are nonsingular exactly when Under these graph conditions, the uniform Green property holds for all sufficiently large horizons. For a prescribed , it holds for every if the finitely many scaled matrices below a large-horizon cutoff are also nonsingular. The conclusions are open under small perturbations of within the hyperbolic symplectic region. The large-horizon conclusion is uniform on compact subsets satisfying the two graph conditions. Uniformity from a prescribed additionally requires the finitely many short-horizon matrices to remain nonsingular on the compact set.
Proof. For , symplecticity gives Thus is isotropic. Reciprocal spectral symmetry gives , so is Lagrangian; applying the same argument to on proves the unstable assertion. Direct multiplication by (6.3) gives (6.4), and the two kernel conditions are precisely (6.5).
Moreover, . If the diagonal blocks in (6.4) are nonsingular, Neumann’s lemma gives a uniform inverse for all sufficiently large ; 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 , continuity of the finitely many remaining singular values gives the corresponding assertion for every . ◻
Recall that is stabilizable if for every . Along every complex solution of (6.1), direct substitution gives the energy identity
Theorem 12 (Stabilizable definite LQ data).
Let be invertible, , , and let be stabilizable. Then is hyperbolic, is invertible, and for every the block is invertible. The rows satisfy the uniform Green property for every . The constants can be chosen uniformly on compact subsets of this data class.
Proof. If with , the left side of (6.6) vanishes along . Hence and . The second block equation gives , contradicting the PBH condition unless . Thus is hyperbolic.
If , sum (6.6) forward to infinity. Exponential decay makes both endpoint pairings vanish, hence and . Here . If , then is nonzero and invariant under . Since is injective, , so is also -invariant. The powers of converge to zero, hence has an eigenvalue of modulus greater than one. Its eigenvector is annihilated by , contradicting the PBH condition. Therefore is invertible.
Let with . Summing the energy identity from to gives a nonnegative sum equal to . Thus for and ; the state equation gives and then . Hence is invertible. By (6.4) and Theorem 3.2, the Green property holds for all sufficiently large horizons.
For a finite homogeneous problem, and . Summing (6.6) gives The sum is nonnegative, so both sides vanish. Consequently , , then , , and backward recursion gives . 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 with . 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 Fix and such that, for every , and . Put Then For and , Uniformly for in compact subsets of , Thus, when two terminal rewards differ only through their Hessians, the induced Riccati matrices and initial gains differ by . 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 , , and . Write and . The terminal graph gives , hence ; substitution at proves (6.8). The costate identity proves (6.9). The dichotomy gives . Moreover, is uniformly bounded: for large this follows from a Neumann argument around , and the finitely many remaining horizons follow from boundary-value uniqueness (uniformly on the stated compact sets). Therefore which proves (6.10). The map 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 with . If the terminal reward satisfies the hypotheses of Theorem 5.1, with and then the original Pontryagin problem has the branch, explicit radius, and sensitivity estimates of Theorem 5.1, with .
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 with rectangular input. Here and . Since is the only eigenvalue of with modulus at least one and , the PBH test gives stabilizability, so Theorem 6.2 applies. The matrix (6.2) has eigenvalue moduli , spectral gap , and, for unit-norm eigenvector bases, and . Thus the canonical graph transversality condition holds with an explicit numerical margin. For shifted rows we take so Theorem 6.2 applies. The nonlinear terminal reward is Direct evaluation gives on . For the nonlinear test we perturb the dynamics to , where , and solve in the unit direction proportional to . Table 1 reports the scaled Green test, quadratic remainder slopes, boundary conditioning, and the explicit neighborhood and posterior tests. The normalized remainder is Across , the scaled boundary condition number is at most , whereas a reliable column-norm lower bound for the unscaled matrix reaches at . Fits over give remainder slopes between and with . The a posteriori test additionally uses and . To test the decay caused by a terminal reward perturbation, we set , with , and evaluate . Fits over for give rates – with , consistent with . The exact LQ graph calculation for changing the terminal Hessian from to gives rate with , consistent with .
For the finite-dimensional residual , where , we also evaluate an explicit direction-independent Newton–Kantorovich data radius. All operator norms in the following calculation are ordinary trajectory infinity norms. With , , and , the condition places the linear predictor in the Kantorovich regime. Indeed, if and , then a Neumann bound at the linear predictor gives Thus Proposition 5.2, in the ordinary infinity norm, applies. Using of this open threshold gives uniform evaluated radii for the canonical row and 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 pass; the four shifted 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 remain inside that box. Failure of the test does not imply nonexistence. At , the shifted posterior reported admissible uniqueness radius is approximately . 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 is a global infinity-norm Lipschitz bound for the Jacobian of the polynomial residual, so Proposition 5.2 allows . Also, Panel (b) reports the directly evaluated posterior quantities . There bounds the distance from the linear predictor to an exact zero, while is one concrete radius strictly inside the admissible uniqueness interval, not a maximal radius. The inverse residual in the displayed rows is below . 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 detects the value at which limiting transversality fails, near ; the least singular values there are for and for . 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 , 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 , stabilizable , , , and a nonpositive terminal Hessian, the certificate holds from , and sensitivity to that Hessian decays at rate . Under strict concavity these stationary solutions are Bellman optimal. Establishing horizon-uniform second-order sufficient conditions for the nonlinear problem remains open.
References
D. P. Bertsekas.
Dynamic Programming and Optimal Control, volume 1.
Athena Scientific, 4th edition, 2017.
S. Bittanti, A. J. Laub, and J. C. Willems, editors.
The Riccati Equation.
Springer, 1991.
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.
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.
W. A. Coppel.
Dichotomies in Stability Theory.
Springer, 1978.
L. Grüne and J. Pannek.
Nonlinear Model Predictive Control: Theory and Algorithms.
Springer, 2nd edition, 2017.
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.
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.
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.
S. Na and M. Anitescu.
Exponential decay in the sensitivity analysis of nonlinear dynamic programming.
SIAM Journal on Optimization, 30 (2): 1527–1554, 2020.
N. Sakamoto and E. Zuazua.
The turnpike property in nonlinear optimal control—a geometric approach.
Automatica, 134: 109939, 2021.
M. Sassano.
Infinite-horizon optimal control of nonlinear discrete-time systems: HJB PDE, Hamiltonian dynamics and invariant manifolds.
Automatica, 179: 112441, 2025.
S. Shin and V. M. Zavala.
Controllability and observability imply exponential decay of sensitivity in dynamic optimization.
IFAC-PapersOnLine, 54 (6): 179–184, 2021.
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.
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.
喜欢的话,留下你的评论吧~