State-constraint static Hamilton-Jacobi equations in nested domains
Yeoneung Kim, Hung V. Tran, Son N. T. Tu

TL;DR
This paper investigates the convergence rates of solutions to state-constraint static Hamilton-Jacobi equations in nested domains, providing optimal rates and new examples in the context of increasing domain sequences.
Contribution
It establishes convergence rates for solutions in nested domains and demonstrates their optimality, expanding understanding of Hamilton-Jacobi equations in complex geometries.
Findings
Derived explicit convergence rates for solutions
Proved optimality of the convergence rates
Presented new examples and discussions
Abstract
We study state-constraint static Hamilton-Jacobi equations in a sequence of domains in such that for all . We obtain rates of convergence of , the solution to the state-constraint problem in , to , the solution to the corresponding problem in . In many cases, the rates obtained are proven to be optimal. Various new examples and discussions are provided at the end of the paper.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
State-constraint static Hamilton-Jacobi equations in nested domains
Yeoneung Kim
Department of Mathematics, University of Wisconsin Madison, 480 Lincoln Drive, Madison, WI 53706, USA
,
Hung V. Tran
Department of Mathematics, University of Wisconsin Madison, 480 Lincoln Drive, Madison, WI 53706, USA
and
Son N. T. Tu
Department of Mathematics, University of Wisconsin Madison, 480 Lincoln Drive, Madison, WI 53706, USA
Abstract.
We study state-constraint static Hamilton–Jacobi equations in a sequence of domains in such that for all . We obtain rates of convergence of , the solution to the state-constraint problem in , to , the solution to the corresponding problem in . In many cases, the rates obtained are proven to be optimal. Various new examples and discussions are provided at the end of the paper.
Key words and phrases:
first-order Hamilton–Jacobi equations; state-constraint problems; optimal control theory; rate of convergence; viscosity solutions.
2010 Mathematics Subject Classification:
35B40, 35D40, 49J20, 49L25, 70H20
The authors were supported in part by NSF grant DMS-1664424. The second and the third authors are supported in part by NSF CAREER grant DMS-1843320.
1. Introduction
Let be a sequence of domains in such that for all . We say that is a sequence of nested domains. Then, is also a domain in . Let be a given continuous Hamiltonian. In this paper, we are interested in studying state-constraint solutions to the following static Hamilton-Jacobi equations:
[TABLE]
and
[TABLE]
The precise definition of state-constraint viscosity solutions is given in Section 2. Under some appropriate conditions, (HJk) has a unique state-constraint viscosity solution for each , and (HJ) has a unique state-constraint viscosity solution . Furthermore, by a priori estimates and the stability results of viscosity solutions, we have that locally uniformly on . Our main focus here is to study how fast this convergence is in two different types of nested domains.
1.1. Assumptions
In the paper, we consider the following two prototypes of nested domains, which are
- (P1)
and ,
- (P2)
, and .
We list the main assumptions that will be used throughout the paper.
- (H1)
There exists such that
[TABLE]
- (H2)
There exists such that
[TABLE]
- (H3a)
There exists a modulus , which is a nondecreasing function satisfying and
[TABLE]
for and .
- (H3b)
For every , there exists a modulus , which is nondecreasing with and
[TABLE]
for and with .
- (H3c)
For each there exists a constant such that
[TABLE]
for and with .
- (H4)
satisfies the coercivity assumption
[TABLE]
- (H5)
is convex for each .
Let us give some quick comments on the assumptions here. Assumption (H1) is necessary to ask a meaningful question about the rate of convergence of to . See the discussion in Section 7 in case where (H1) fails to hold. Besides, it is clear that (H3b) is weaker than both (H3a) and (H3c).
1.2. Main results
There have been many works in the literature on the well-posedness of state-constraint Hamilton-Jacobi equations and fully nonlinear elliptic equations. The state-constraint problem for first-order convex Hamilton-Jacobi equations using optimal control frameworks was first studied in [27, 28]. The general nonconvex, coercive first-order equations was then discussed in [10]. For further developments in using optimal control formulation and obtaining optimal paths, we refer the readers to [17, 19, 12, 11, 6, 1, 14, 26, 25] for the finite dimensional cases, and [8, 20] for the infinite dimensional cases. See [7] for discrete numerical schemes, and [24] for large time behavior results. We also refer to the classical books [5, 4] and the references therein.
The state-constraint problem for second-order equations was first studied in [21] for the Laplacian, and in [3] for the general possibly degenerate diffusion matrices. Boundary behavior of blow-up solutions was discussed in [21, 23, 3]. Convex solutions with state-constraint boundary were constructed in [2, 13]. The convergence of solutions to the vanishing discount problems was proved in [18].
In terms of state-constraint problems in nested domains, up to our knowledge, there are only qualitative results in the literature in [10, 3] where certain approximations were needed for the analysis of solutions. We provide here some first quantitative results on the rate of convergence of the solutions to (HJk) as goes to infinity in two different types ((P1) or (P2)) of nested domains.
First of all, we show that the rate of convergence is for the prototype (P1) for general nonconvex Hamiltonians.
Theorem 1.1**.**
Under the assumptions , (H1), (H2), (H3c), and (H4), we have
- (i)
* for every ,*
- (ii)
there exists a constant depending only on such that
[TABLE]
for and .
In particular, for any fixed and ,
[TABLE]
The condition that is important since there are examples where the estimate above fails at the boundary of . In Proposition 5.10, we have, for each , for some .
Theorem 1.2**.**
Assume . Assume further that for . Here, , is locally Lipschitz and coercive in , and satisfies for some given . Then, , and for every , we have
[TABLE]
where is a constant depending only on . In particular, for any fixed , we have
[TABLE]
for every and . In addition to that, this exponential rate is optimal.
It is quite interesting to observe that we obtain the exponential rate of convergence for this particular class of nonconvex Hamiltonians and the rate is indeed optimal. When is a positive constant, the assumption in the theorem above can be removed.
Corollary 1.3**.**
Assume . Assume further that for . Here, is locally Lipschitz and coercive in . Then, , and for every , we have
[TABLE]
where is a constant depending only on . In particular, for any fixed , we have
[TABLE]
for every and . In addition to that, this rate is optimal.
When , the analysis becomes much more complicated due to the interaction between and . We provide an example where the exponential rate of convergence is obtained in Example 2.
For convex Hamiltonians, we are able to establish the exponential rate of convergence using optimal control theory. Some examples for which the exponential rate is obtained are given in Proposition 5.10 and Proposition 5.11.
Theorem 1.4**.**
Under the assumptions , and , we have
- (i)
* for every ,*
- (ii)
for each fixed we have
[TABLE]
where is a constant depending only on the growth of .
In particular, for any fixed , we have
[TABLE]
for all and .
As a byproduct, we prove the existence of a minimizer with bounded velocity to the minimizing problem (5.2) for each given , which is a key element in the proof of Theorem 1.4. Moreover, the bound on the velocity of only depends on the growth of and not on its smoothness. We believe that this bound (Theorem 5.7 and Lemma 5.9) is new in the literature. See Remark 6 for further discussions.
For the second prototype (P2), we establish the rate for a quite general class of Hamiltonians. The rate is also optimal, as pointed out in Remark 9.
Theorem 1.5**.**
Under assumptions and (H4), for any ,
[TABLE]
for every where is a constant depending only on . Moreover, this rate is optimal.
Although we only deal with two prototype cases (P1) and (P2) in this paper, the obtained results can be extended to more general domains in a similar fashion under some appropriate conditions. See Remarks 8 and 10 for example.
1.3. Organization of the paper
The paper is organized in the following way. We first provide some results on state-constraint Hamilton-Jacobi equations needed throughout the paper in Section 2. Section 3 and 4 are devoted to proving Theorem 1.1 and Theorem 1.2, respectively. In the following section, we deal with the rate of convergence for convex Hamiltonians (Theorem 1.5). In Section 6, the second prototype case is considered. We provide some examples and further discussion in Section 7. The proofs for some results concerning minimizers of the corresponding optimal control problem are provided in Appendix.
Acknowledgement
We would like to thank the two referees very much for carefully reading our manuscript and giving very helpful comments to improve the presentation of the paper.
2. Preliminaries
For an open subset , we denote the space of bounded uniformly continuous functions defined in by .
Definition 1**.**
We say
- (i)
* is a viscosity subsolution of (HJ) in if for every and such that has a local maximum over at then v(x)+H\big{(}x,D\varphi(x)\big{)}\leq 0.*
- (ii)
* is a viscosity supersolution of (HJ) on if for every and such that has a local minimum over at then v(x)+H\big{(}x,D\varphi(x)\big{)}\geq 0.*
If is a viscosity subsolution to (HJ) in , and is a viscosity supersolution to (HJ) on , that is,
[TABLE]
in the viscosity sense, then we say that is a state-constraint viscosity solution of (HJ).
Remark 1*.*
As pointed out in [27], the state-constraint implicitly imposes a boundary condition to solutions. Indeed, when is smooth, we can define an outward normal vector at . Moreover, if the state-constraint solution , then solves in and satisfies
[TABLE]
If is differentiable in , the above condition can also be phrased as a constraint on the normal derivative on the boundary as
[TABLE]
Now we construct a state-constraint viscosity solution to (HJ) based on Perron’s method. It is a variant of the classical result in [15] but we include the proof here for the sake of the readers’ convenience. Note that the Lipschitz regularity of subsolutions is encoded directly into the admissible class .
Definition 2**.**
For a real valued function define for , we define the super-differential and sub-differential of at as
[TABLE]
Theorem 2.1**.**
Assume (H1), (H2) and (H4). Then, there exists a state-constrained viscosity solution to (2.1).
Proof of Theorem 2.1.
Under (H1) and (H2), and are a supersolution on and a subsolution in of (HJ), respectively. By the coercivity assumption (H4), we can find a constant such that
[TABLE]
Let us define
[TABLE]
and for each , we define
[TABLE]
By the stability of viscosity subsolutions, we have that is a viscosity subsolution to (HJ) in . Thus, as well.
We now check that is a viscosity supersolution to (HJ) on . Assume that is not a supersolution on . Then, there exists , with and such that and for all , and
[TABLE]
From (H1) and (2.3), we obtain . By continuity of and , one can choose small enough so that and
[TABLE]
for all . Clearly, is a viscosity subsolution to (HJ) in and for . Let us define by
[TABLE]
Then, in belongs to . Therefore, is a viscosity subsolution to (HJ). However, , which is a contradiction to the definition of . ∎
The argument used in the proof of Perron’s method implies the following corollary as well (see also [10]).
Corollary 2.2**.**
Let be a viscosity subsolution to (HJ) in . Assume further that on for all viscosity subsolutions of (HJ) in . Then, is a viscosity supersolution to (HJ) on .
The uniqueness of (2.1) follows from the comparison principle. It was first studied by M. Soner in [27] under the following assumption on :
- (A)
There exists a universal pair and a uniformly bounded continuous function such that
[TABLE]
See also [10] for other conditions to establish the comparison principle.
Theorem 2.3**.**
Assume . If is a viscosity subsolution of (HJ) in , and is a viscosity supersolution of (HJ) on . If either
- •
(H3a) holds, or
- •
(H3b) holds and is Lipschitz,
then for all .
When the uniqueness of (2.1) is guaranteed, the unique viscosity solution to (2.1) is the maximal viscosity subsolution of (HJ). This property will play a crucial role in dealing with the second prototype .
3. A rate of convergence for general Hamiltonians in unbounded domain
In this section, we consider the first prototype (P1). The assumptions (H1), (H2), (H3c) and (H4) are enforced throughout the section. By Theorems 2.1 and 2.3, there exists which is the unique solution to
[TABLE]
in the viscosity sense. Based on the construction of solutions via Perron’s method together with the coercivity of , we have the following a priori estimate:
[TABLE]
for all in the viscosity sense. Here, is a positive constant depending only on (one can take from Theorem 2.1). By the Arzelà–Ascoli theorem, there is a subsequence , and a function such that
[TABLE]
Theorem 3.1**.**
The function defined in (3.2) is a viscosity solution to
[TABLE]
Moreover, locally uniformly in as grows to infinity.
Proof.
It is clear from the stability of viscosity solutions that is a solution to (3.3). The fact that locally uniformly in follows from the uniqueness of solutions to (3.3). ∎
Now we are ready to give a proof for Theorem 1.1 using the doubling variables method.
Proof of Theorem 1.1.
We first note that solves on , and solves in in viscosity sense. By the comparison principle, we get for all .
For the upper bound of , we define the following auxiliary function
[TABLE]
for . It is clear that is bounded above by independent of . If , then we have
[TABLE]
which implies that for each , achieves a global maximum over at . Of course, . Now we use to get
[TABLE]
Therefore, we deduce that
[TABLE]
for all since . Observing that obtains a maximum at with , we have
[TABLE]
where by the definition of viscosity subsolutions. We also observe that obtains a maximum at , which implies that
[TABLE]
has a minimum at . By the definition of viscosity supersolutions, we get
[TABLE]
where . Here, it needs to be noted that
[TABLE]
which comes from Lipschitz continuity of . Using (3.5), (3.6) and assumption (H3c), there exists a constant such that
[TABLE]
If we stop here, the fact that for gives
[TABLE]
for all . This gives us the rate of convergence of to is for , which is typically the case in light of the doubling variables method.
Nevertheless, a key new point here is to bootstrap once more to improve this rate. The monotonicity of allows us to bound better. We use that together with (3) and to yield
[TABLE]
Therefore,
[TABLE]
In particular, . This bound is much better than the earlier bound that .
Now for any , clearly we have that . This, together with (3) and , implies
[TABLE]
for all . If , then
[TABLE]
which gives the desired result. ∎
Remark 2*.*
In the general setting, one only has that achieves a global maximum over at where and . In our current situation, the monotonicity of allows us to bootstrap once more to deduce further that , which helps to obtain rate of convergence. This seems to be the best convergence rate that one is able to get through the doubling variables method here as it is unlikely that vanishes as .
We do not know yet whether the rate of convergence is optimal or not in the general nonconvex setting. See Questions 1 and 2 in Section 7 below.
4. An optimal rate for a class of nonconvex Hamiltonians on unbounded domain
In this section, we show that the rate of convergence is of order for a class of possibly nonconvex Hamiltonians which are written as with and . The aforementioned rate is indeed optimal.
A brief idea for the proof is that we construct a supersolution to (3.1) by finding a symmetric Hamiltonian such that and . The following proposition is needed as a building block.
Proposition 4.1**.**
Let be defined by
[TABLE]
where and is a coercive continuous function such that for and . Then,
[TABLE]
for is the unique solution to the state-constraint problem (3.1).
Proof.
It is clear that in in classical sense. For and such that has a local minimum over at , we have since . We only need to check if is a viscosity supersolution at .
Let such that and has a local minimum over at . Since is convex, we can replace by an affine function for some . Without loss of generality, it suffices to consider . For sufficiently small, we have , which implies that
[TABLE]
Now we choose for small, then (4.1) implies that \alpha\beta e^{-\frac{k}{\alpha}}\big{(}e^{\frac{t}{\alpha}}-1\big{)}\geq t|\xi| for all sufficiently small. Dividing both sides by and sending to 0, we deduce that . Therefore,
[TABLE]
Consequently, is the unique viscosity solution to (3.1). ∎
Proof of Theorem 1.2.
Since , is the unique solution to (3.3). Recalling the a priori estimate , condition (H3c) gives
[TABLE]
for all . Let for some . Let be a coercive, continuous function such that for , , and for . Now we consider
[TABLE]
The graph of is described in Figure 4.1. It is clear that for all . Moreover, using Proposition 4.1, the unique viscosity solution to the state-constraint problem in is given by for .
It is clear that is also the unique viscosity solution to in . Since and , we deduce that
[TABLE]
on . Therefore, on . By the comparison principle, one gets
[TABLE]
for all . The conclusion for follows immediately. ∎
In case that for , where is locally Lipschitz continuous and coercive in , we have the unique viscosity solution to (3.3) is . Therefore, we can assume that , and Corollary 1.3 follows without assuming that .
It should be noted that the local Lipschitz continuity of Hamiltonians is important when it comes to getting an exponential rate of convergence. If a Hamiltonian is only Hölder continuous around [math], we get a slower rate of convergence depending on the regularity of as described in the following proposition.
Proposition 4.2**.**
Let defined by
[TABLE]
where and is a continuous, coercive function with for , and . Then, the solution to (3.1) is given by
[TABLE]
As a consequence, with the rate .
Proof.
Let us first consider the one dimensional case. The higher dimensional setting can be done in a same manner. Let , we look for a nonnegative solution to where . We have
[TABLE]
We want to choose such that for . Equivalently,
[TABLE]
for . Since it is an increasing function, . Using symmetry, we guess that is written as
[TABLE]
It is straightforward to see that satisfies the equation in the classical sense in . Since on , we have in the classical sense in . At , we have . Therefore, the supersolution test at these points are satisfied. Finally, at we only need to verify the supersolution test, which is simple since if then
[TABLE]
Thus, defined above is the unique viscosity solution to the constraint problem (3.1). Using a similar argument as in the proof of Proposition 4.1, this formula of can be extended naturally to the -dimensional case, as given in (4.2) and the conclusion follows. ∎
Remark 3*.*
From Proposition 4.2 we see that the optimal rate of convergence can be as slow as we wish as the Hölder exponent . This shows that the required condition (H3c) is really essential in this section.
When Hamiltonians are of the form , the situation becomes much more complicated. See Example 2 for a situation where we get the optimal exponential rate of convergence with nonconvex .
5. An optimal rate for convex Hamiltonians
In this section, the assumptions , , , are always in force. The state-constraint problem was studied in the context of optimal control for convex Hamiltonians (see [27, 10, 4] for instance). When is convex, we are able to obtain a representation formula for the viscosity solution based on the optimal control theory. Let us assume the following superlinear property (see Remark 4 where we can remove this assumption), which is
- (H6)
is superlinear uniformly for , that is,
[TABLE]
If and (H6) hold, then the Legendre transform of is defined as
[TABLE]
Lemma 5.1**.**
Assume and (H6). Then, is continuous satisfying:
If holds, then for all ;
If holds, then for all ;
- (L3)
If holds, then for each there exists a modulus such that
[TABLE]
- (L5)
* is convex for each ;*
- (L6)
* is superlinear uniformly in , i.e.,*
[TABLE]
We omit the proof of this lemma and refer the interested readers to [9].
For each , we define the admissible set of paths as
[TABLE]
where \mathrm{AC}\big{(}[0,\infty);\mathbb{R}^{n}\big{)} denotes the set of absolutely continuous curves from to . Note that since for all is an admissible path. From this, define the value function as
[TABLE]
where the cost functional is defined as
[TABLE]
for . Now we have the following classical dynamic programming principle.
Theorem 5.2** (Dynamic Programming Principle).**
For any , we have
[TABLE]
Using the Dynamic Programming Principle, one can prove that and indeed a viscosity solution to (2.1) as stated in the following theorems.
Theorem 5.3**.**
Assume (H1), (H2), (H3c), and (H6), then the function defined by (5.1) is bounded and is uniformly continuous up to the boundary, which is .
Theorem 5.4**.**
The value function defined in (5.1) is a viscosity solution to the state-constraint Hamilton-Jacobi equation in , i.e.,
[TABLE]
We omit the proofs of Theorems 5.2, 5.3 and 5.4. We refer to [27, 10, 4] for those who are interested.
On the other hand, when , it is known that the function defined in (5.1) satisfies the Hamilton-Jacobi equation (3.3) in viscosity sense (see [4, 22] for instance).
Theorem 5.5**.**
For each , we define
[TABLE]
subject to \mathcal{A}_{x}=\left\{\eta\in\mathrm{AC}\big{(}[0,\infty);\mathbb{R}^{n}\big{)}:\eta(0)=x\right\}. Then, is a viscosity solution to (3.3) and we have the following priori estimate:
[TABLE]
Remark 4*.*
We may assume that is just coercive rather than superlinear. When a Hamiltonian is coercive, we still have that (5.3) holds for some . Therefore, for , we can modify so that (H6) holds. Furthermore, we can impose a quadratic growth rate on as following.
- (H7)
There exist some positive constants such that
[TABLE]
It is easy to see from that we have for all . By making bigger, we can assume the following.
- (L7)
[TABLE]
We give a proof for the existence of a minimizer with bounded velocity to (5.2) for the sake of readers’ convenience in Appendix. This is an extremely important fact in our analysis and is a key element in the proof of Theorem 1.4 (see Remark 6 for further discussions). To establish this point, the following lemma on the subdifferentials of in is needed. For continuously differentiable Lagrangians, it is obvious, but we state here a slightly more general version.
Lemma 5.6**.**
Let be continuous and satisfy and (L7). There exists such that for all , we have
[TABLE]
For simplicity, let us assume further that
- (L8)
is continuously differentiable on .
This assumption can be removed in the proof of Theorem 1.4 due to the fact that the estimate (1.1) does not depend on the regularity of , hence, we can approximate by convex, smooth Hamiltonians.
Theorem 5.7** (Existence of a minimizer).**
Let be a continuous Lagrangian satisfying , (L7) and . Then, for each , there exists such that and also where depends only on .
The existence of minimizers of smooth Lagrangian is sufficient for our proof of Theorem 1.4 since the last estimate does not depend on the smoothness of or . Clearly, a minimizer for a general continuous Lagrangian can be obtained via approximation of smooth Lagrangians (see Appendix).
A minimizer to (5.2) satisfies the following properties.
Lemma 5.8**.**
Let and be a corresponding minimizer. For any , we have
[TABLE]
Furthermore, for every , we have
[TABLE]
and
[TABLE]
Lemma 5.9**.**
Let and be a minimizer to (5.2) associated with it. Then, there exists a constant depending only on such that for a.e. .
Remark 5*.*
We provide here a connection between a minimizer of and some properties in the view of the method of characteristics. If is assumed to be , then and is a weak solution to the Euler-Lagrange equation
[TABLE]
Assume that (it holds if, for instance for some ). Then, one can define the momentum and show that
[TABLE]
for . Indeed, for every fixed , we recall that
[TABLE]
Using (5.10) we can deduce that
[TABLE]
From that, we can derive the characteristic ODEs for , which are
[TABLE]
This together with (5.6) yields that
[TABLE]
Lemma 5.6 together with Lemma 5.9 gives us a uniform bound on p, thus . Hence, (5.9) follows.
Now we give a proof for Theorem 1.4. Recall that we have the value function
[TABLE]
where \mathcal{A}^{k}_{x}=\Big{\{}\eta\in\mathrm{AC}\big{(}[0,\infty);\mathbb{R}^{n}\big{)}:\eta(0)=x\;\text{and}\;\eta(s)\in\overline{B(0,k)}\;\text{for}\;s\geq 0\Big{\}}. Then, solves the state-constraint problem (3.1).
Proof of Theorem 1.4.
Let be given. We may assume that satisfies (H6) and (H7) up to modification for large enough. Also, since the final estimate does not depend on the smoothness of , we can assume is smooth and thus is smooth without any loss of generality. Clearly, for any , which implies that .
For , let be a minimizer to (5.2), if for all , then as well, hence . Otherwise, there exists such that and for all . By Lemma 5.9, we have
[TABLE]
which implies that . Let us define
[TABLE]
so that . Using Lemma 5.8, we have
[TABLE]
Consequently, we obtain (1.1). The conclusion for follows immediately. ∎
Remark 6*.*
Here, we note that the constants in the proof above do not depend on the regularity of the Lagrangian. As long as a minimizer exists, we get the same exponential rate of convergence. See Appendix for a discussion on the existence of minimizers. It is worth noting here that, for each , the existence of a minimizer to (5.2) with bounded velocity is a nontrivial fact and plays an essential role in the proof above. Moreover, the bound on the velocity of only depends on .
In the rest of this section, we provide two explicit examples to show that the rate is indeed optimal.
5.1. Examples with exponential rate of convergence
Proposition 5.10**.**
Let be defined by for and elsewhere such that is continuous and coercive. Let be the solution to (3.1) on , then locally uniformly on as . Here, is the unique solution to (3.3). Furthermore, we have for all and
[TABLE]
Proof.
It is clear that solves in in the classical sense, and indeed, in viscosity sense. We need to verify that is a viscosity supersolution on . Let has a local minimum at for . Clearly, we can see that
[TABLE]
which implies . On the other hand, at , one has
[TABLE]
since by definition of , it is bounded below by . Therefore, is the unique viscosity solution to (3.1), and furthermore for all . In addition to that, we have for all , hence, the convergence fails when . ∎
5.2. Optimal control formulations
We give another example from the optimal control theory point of view (see [27]). Let us recall briefly the setting of optimal control as follows. Let be a compact metric space. We regard a control as a Borel measurable map . Let be an open subset of with the connected boundary satisfying (A). We also assume that , satisfy
[TABLE]
where are positive constants and is a nondecreasing continuous function with .
For each and a given control , let be a controlled process (we will write instead of as a control for simplicity), which is a solution to
[TABLE]
We denote the set of controls (strategies) where for all and solves the ODE above by . The value function is defined by
[TABLE]
Here, one can define the Hamiltonian associated with and as
[TABLE]
It was proved in [27] that is a viscosity solution to (2.1).
Proposition 5.11**.**
Let and . Let us consider the following Hamiltonian defined as
[TABLE]
Then, the solution to (3.1) is given by for , while the solution to (3.3) is . Hence, the exponential rate of convergence is obtained.
Proof.
In the optimal control setting, the Hamiltonian above is obtained by considering , and . To find and , one needs to find a control that minimizes
[TABLE]
It is easy to see the following points:
An optimal control for the unconstrained problem with () is (, respectively).
An optimal control for the constrained problem on with () is on and 0 elsewhere ( on and 0 elsewhere, respectively).
Once we have the optimal controls, we can easily compute the value function and the result follows. In conclusion, for all we have
[TABLE]
In this example, the convergence holds everywhere in with the rate . ∎
Remark 7*.*
One interesting fact to point out here is that the optimal path starting from for the state-constraint problem on in Proposition 5.11 stays on the boundary for all .
6. The case of bounded domain
The second prototype case is considered in this section. Let us assume that (P2), , and (H4) are enforced. Recall that for , and . Let be the unique viscosity solution to
[TABLE]
It is clear that we still have the following priori estimate
[TABLE]
Proposition 6.1**.**
For each , let be the unique solution to (6.1). Then, there exists such that locally uniformly on as grows to infinity. Moreover, has the same bounds as in (6.2) and solves
[TABLE]
in viscosity sense.
Proof.
From a priori estimate (6.2), by Arzelà-Ascoli’s theorem and a diagonal argument we can extract a subsequence such that uniformly on compact subsets of . By the stability of viscosity solutions we obtain that is a viscosity solution to
[TABLE]
We deduce that and for . We can extend with the same priori bound as in (6.2). We need to show that is a viscosity supersolution to on .
We can verify it using Corollary 2.2. Indeed, let be a viscosity subsolution to (6.4) in . Applying the comparison principle to on , we have that for . Now fixing , we have for all and if is large enough. Letting , we deduce that for . Since we have , the inequality on follows. Hence, is a viscosity supersolution to (6.4) by Corollary 2.2. ∎
Now we are ready to give a proof for Theorem 1.5. We note that star-shaped and scaling properties of play an important role.
Proof of Theorem 1.5.
The fact that on is clear by the comparison principle. For , let us define
[TABLE]
It is clear that is a viscosity subsolution to
[TABLE]
From (6.2) and (H3c), there exists such that for all and . Therefore, by using (6.5) we have
[TABLE]
for all . By the comparison principle and the fact that solves (6.3) in the viscosity sense, we deduce that
[TABLE]
Consequently, we obtain the conclusion for where the constant can be chosen as . ∎
Remark 8*.*
- (i)
It is clear from the proof that prototype condition (P2) can be relaxed as following.
- (P2’)
Assume for all , is bounded, and the comparison principle for the state-constraint problem holds on . Assume further that, for ,
[TABLE]
- (ii)
Theorem 1.5 can also be proved using the doubling variable method with the following auxiliary function (see [10])
[TABLE]
for .
The following remark shows that the rate is indeed optimal.
Remark 9*.*
Let be defined as in Proposition 5.10, we see that solves (6.1) and solves (6.3), therefore
[TABLE]
for . Besides, , and so, is optimal.
7. Discussions
We give here some further discussions along the line with the topics considered in the paper. Firstly, when our Hamiltonian is given as in the first prototype (P1), we get an exponential rate of convergence provided that the assumption (H1) is enforced (Theorem 1.2). Without this assumption, we have an example with a polynomial rate of convergence whose power can be increased or decreased as much as we want.
Example 1**.**
Let us consider , for and defined by
[TABLE]
The unique viscosity solution to (3.1) is
[TABLE]
Clearly, locally uniformly with rate for any given . We should note that the limit [math] is not a unique solution to (3.3). Another solution to (3.3) is , but it does not belong to .
Example 2**.**
Assume , where and defined by
[TABLE]
The unique state-constraint viscosity solution to (3.1) is
[TABLE]
and the unique viscosity solution to (3.3) is
[TABLE]
We have locally uniformly in with rate .
Secondly, prototype condition (P1) can be relaxed as follows.
Remark 10*.*
It is clear from the proofs of our main results (Theorems 1.1, 1.2, 1.4, and Corollary 1.3) that prototype condition (P1) can be relaxed as following.
- (P1’)
Assume is bounded, , and the comparison principle for the state-constraint problem holds on for all . Of course, here.
Thirdly, there are some open questions we are not able to answer yet.
Question 1**.**
In the first prototype (P1) case, what is the optimal rate of convergence of to in the general nonconvex setting?
A more specific question is as follows.
Question 2**.**
Assume (P1), and , where is coercive and nonconvex, and . Is it true that we always have an exponential rate of convergence of to ?
8. Appendix
8.1. Proofs of some lemmas
Proof of Lemma 5.6.
We first prove the result for all with , then by scaling we get the result for all . Using (L7) we have for all with . For with , let . Then, . Let , we have . By the convexity, one obtains
[TABLE]
By symmetry, we deduce that for all with . In other words, we have that whenever for . Now for , we define for . We observe that
[TABLE]
for all . For with , let and so that . Since implies , we have . ∎
Proof of Theorem 5.7.
Let be a minimizing sequence in such that . From the uniform boundedness of and the quadratic bounds of , we have
[TABLE]
Here, can be chosen as . By the weak compactness of , there exists such that e^{-\frac{s}{2}}g(s)\in L^{2}\big{(}(0,\infty);\mathbb{R}^{n}\big{)} and a subsequence such that weakly in L^{2}\big{(}(0,\infty);\mathbb{R}^{n}\big{)} as .
Writing as and using the Cauchy-Schwartz inequality, we get g\in L^{1}_{\mathrm{loc}}\big{(}(0,\infty);\mathbb{R}^{n}\big{)}. For , we let . Clearly, and one obtains that pointwise with almost everywhere. On the other hand, the convexity of implies
[TABLE]
Therefore,
[TABLE]
Since for a.e. , it is clear that
[TABLE]
in and thus
[TABLE]
converges to 0 as goes to infinity, which yields that . Hence . ∎
Proof of Lemma 5.8.
By the definition of in (5.1), we have
[TABLE]
where for . Thus,
[TABLE]
By the dynamic programming principle and (8.1), we have
[TABLE]
Therefore, (5.5), (5.6) and (5.7) follow. ∎
Proof of Lemma 5.9.
For every , by Lemma 5.8 we have that
[TABLE]
Let such that has a local min at and u\big{(}\eta(t)\big{)}=\varphi\big{(}\eta(t)\big{)}, then
[TABLE]
Therefore,
[TABLE]
Since is differentiable a.e. in , at those where is differentiable, let we deduce that
[TABLE]
Thus, for a.e. where is differentiable, we have
[TABLE]
By (L7) and a priori estimate (5.3) for a.e. we have that
[TABLE]
This shows that for a.e. , and only depends on . ∎
It is worth emphasizing again here that the bound on the velocity of only depends on , which can be seen clearly from the last chain of inequalities in the above proof. In fact, one can choose explicitly that .
8.2. Existence of minimizers in the general case
We show that one can remove the smoothness of in Theorem 5.7 under the assumption .
Let us consider mollifiers in defined as such that for where satisfying , and .
For each we define the convolution . It is easy to see that is bounded below, are preserved to and now becomes:
- (L7ε)
There exist positive constants such that for all , and as .
By Theorem 5.7, there exists a minimizer in such that
[TABLE]
Let be the Legendre transform of . Then, we can show that is the unique solution to in . It is easy to see that locally uniformly in , therefore by stability of viscosity solutions, locally uniformly in as .
We indeed have that is smooth according to Remark 5. Furthermore, Theorem 5.7 yields that and pointwise in . Therefore, we can define such that (up to subsequence) locally uniformly on and weakly in . Since uniformly on a compact set and is bounded, we obtain that
[TABLE]
using . Therefore, it suffices to show that
[TABLE]
For simplicity, let be a probability measure on . It is easy to see that the functional maps is convex and lower semicontinuous, thus it is also weakly lower semicontinuous. Now since weakly in , we obtain (8.2) and thus is a minimizer for .
Remark 11*.*
Inequality (8.2) for the Cauchy problem (finite time horizon) is proved using a different argument by H. Ishii in [16] under more general assumptions. Such inequalities are crucial for the analysis of large time behavior of solutions to the time-dependent problems.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Altarovici, A., Bokanowski, O., and Zidani, H. A general Hamilton–Jacobi framework for non-linear state-constrained control problems. ESAIM: COCV 19 , 2 (2013), 337–357.
- 2[2] Alvarez, O., Lasry, J.-M., and Lions, P.-L. Convex viscosity solutions and state constraints. Journal de Mathématiques Pures et Appliquées 76 , 3 (1997), 265 – 288.
- 3[3] Armstrong, S. N., and Tran, H. V. Viscosity solutions of general viscous Hamilton–Jacobi equations. Mathematische Annalen 361 , 3 (Apr 2015), 647–687.
- 4[4] Bardi, M., and Capuzzo-Dolcetta, I. Optimal Control and Viscosity Solutions of Hamilton–Jacobi–Bellman Equations . Modern Birkhäuser Classics. Birkhäuser Basel, 1997.
- 5[5] Barles, G. Solutions de viscosité des équations de Hamilton–Jacobi . Mathématiques et Applications. Springer-Verlag Berlin Heidelberg, 1994.
- 6[6] Bokanowski, O., Forcadel, N., and Zidani, H. Deterministic state-constrained optimal control problems without controllability assumptions. ESAIM: COCV 17 , 4 (2011), 995–1015.
- 7[7] Camilli, F., and Falcone, M. Approximation of optimal control problems with state constraints: Estimates and applications. In Nonsmooth Analysis and Geometric Methods in Deterministic Optimal Control (New York, NY, 1996), B. S. Mordukhovich and H. J. Sussmann, Eds., Springer New York, pp. 23–57.
- 8[8] Cannarsa, P., Gozzi, F., and Soner, H. M. A boundary-value problem for Hamilton–Jacobi equations in Hilbert spaces. Applied Mathematics and Optimization 24 , 1 (Jul 1991), 197–220.
