Sufficient conditions for unique global solutions in optimal control of semilinear equations with $C^1-$nonlinearity
A. Ahmad Ali, K. Deckelnick, and M. Hinze

TL;DR
This paper establishes sufficient conditions ensuring that solutions to certain semilinear elliptic optimal control problems are globally optimal, extending previous results and providing explicit criteria at both continuous and discrete levels.
Contribution
It generalizes prior work by deriving explicit global optimality conditions for semilinear elliptic control problems with $C^1$ nonlinearities, including the case of $ ext{sign}(s)$ nonlinearity.
Findings
Derived explicit global optimality conditions for continuous problems.
Extended conditions to discrete problem settings.
Numerical tests demonstrate practical applicability.
Abstract
We consider a semilinear elliptic optimal control problem possibly subject to control and/or state constraints. Generalizing previous work we provide a condition which guarantees that a solution of the necessary first order conditions is a global minimum. A similiar result also holds at the discrete level where the corresponding condition can be evaluated explicitly. Our investigations are motivated by G\"unter Leugering, who raised the question whether our previous results can be extended to the nonlinearity . We develop a corresponding analysis and present several numerical test examples demonstrating its usefulness in practice.
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.
Taxonomy
TopicsAdvanced Numerical Methods in Computational Mathematics · Computational Fluid Dynamics and Aerodynamics · Numerical methods for differential equations
Sufficient conditions for unique global solutions in optimal control of semilinear equations with nonlinearity
Ahmad Ahmad Ali111Schwerpunkt Optimierung und Approximation, Universität Hamburg, Bundesstraße 55, 20146 Hamburg, Germany., Klaus Deckelnick222Institut für Analysis und Numerik, Otto–von–Guericke–Universität Magdeburg, Universitätsplatz 2, 39106 Magdeburg, Germany & Michael Hinze333Schwerpunkt Optimierung und Approximation, Universität Hamburg, Bundesstraße 55, 20146 Hamburg, Germany.
Abstract
We consider a semilinear elliptic optimal control problem possibly subject to control and/or state constraints. Generalizing previous work in [2] we provide a condition which guarantees that a solution of the necessary first order conditions is a global minimum. A similiar result also holds at the discrete level where the corresponding condition can be evaluated explicitly. Our investigations are motivated by Günter Leugering, who raised the question whether the problem class considered in [2] can be extended to the nonlinearity . We develop a corresponding analysis and present several numerical test examples demonstrating its usefulness in practice.
Dedicated to Günter Leugering on the occasion of his 65th birthday.
1 Introduction and problem setting
Let be a bounded, convex polygonal/polyhedral domain, in which we consider the semilinear elliptic PDE
[TABLE]
We assume that is a Carathéodory function with a.e. in and that
[TABLE]
Under the above conditions it can be shown that for every the boundary value problem (1.1), (1.2) has a unique solution . Next, let us introduce , where with . For given we then consider the optimal control problem
[TABLE]
Here, satisfy for all , where is compact and either or . In the latter case we suppose in addition that . It is well–known that has a solution provided that a feasible point exists (compare [5]). Under some constraint qualification, such as the linearized Slater condition, a local solution of then satisfies the following necessary first order conditions, see [5, Theorem 5.2]: There exist and a regular Borel measure such that
[TABLE]
In view of the nonlinearity of the state equation problem is in general nonconvex and hence there may be several solutions of the conditions (1.5)–(1.8). The problem we are interested in is whether it is possible to establish sufficient conditions which guarantee that a solution of (1.5)–(1.8) is actually a global minimum of . A first result in this direction was obtained by the authors in [2] and holds for a class of nonlinearities which satisfy a certain growth condition:
Theorem 1.1**.**
([2, Theorem 3.2]) Let ; suppose that belongs to for almost all and that there exist and such that
[TABLE]
Assume that solves (1.5)–(1.8) and that
[TABLE]
where and denotes the constant in (2.6) below. Then is a global minimum for Problem . If the above inequality is strict, then is the unique global minimum.
Assumption (1.9) is satisfied for provided that if we choose . Günter Leugering recently raised the question whether our theory can be extended to include the case . The corresponding nonlinearity appears for example in the mathematical modeling of gas flow through pipes with PDEs [16, (5.1)], so that an extension of Theorem 1.1 to this case could be helpful in understanding the optimal control of pipe networks. As is no longer it does not fit directly into the theory above. However it turns out that instead the analysis can be built on the fact that satisfies a global Lipschitz condition.
The purpose of this paper is to generalize Theorem 1.1 in several directions. To begin, we shall replace (1.9) by a condition that can be formulated for –nonlinearities and is satisfied by the functions for every thus including the case suggested by Günter Leugering, see (2.4). A second generalization concerns the choice of the norm in condition (1.10). Even though the integration index is quite natural (solve for ), it is nevertheless possible to formulate a corresponding result not just for one index but for belonging to a suitable interval, see (2.9), thus giving additional flexibility in its application. Our arguments are natural extensions of the analysis presented in [2] and will also cover the case left out in Theorem 1.1.
There is a lot of literature available considering the problem . For a broad overview, we refer the reader to the references of the respective citations. In [5] this problem is studied for boundary controls. The regularity of optimal controls of and their associated multipliers is investigated in [12] and [11]. Sufficient second order conditions are discussed in e.g. [9, 7, 8] when the set contains finitely/infinitely many points. For the role of those conditions in PDE constrained optimization see e.g. [13].
The finite element discretization of problem in rather general settings is studied in [4, 10, 19]. Convergence rates for sets containing only finitely many points are established in [23] for finite dimensional controls, and in [6] for control functions. Only in [27, 3] an error analysis is provided for general pointwise state constraints in . Error analysis for linear-quadratic control problems can be found in e.g. [11], [14, 15] and [24]. Improved error estimates for the state in the case of weakly active state constraints are provided in [28]. A detailed discussion of discretization concepts and error analysis in PDE-constrained control problems can be found in [20, 21] and [17, Chapter 3].
The organization of the paper is as follows: in § 2 we shall develop the optimality conditions outlined above. In addition to the criteria based on an –norm of we shall also include a result that uses a sign of . The variational discretization of is considered in § 3 and is based on a finite element approximation of (1.1), (1.2) that uses numerical integration for the nonlinear term. We obtain corresponding optimality criteria for discrete stationary points and apply these conditions in a series of numerical tests in § 4 including the nonlinearity .
2 Optimality conditions for
In what follows we assume that is a solution of (1.5)–(1.8). Let be a feasible control, the associated state such that in . A straightforward calculation shows that
[TABLE]
Combining (1.6) for with (1.8) and (1.1) we deduce that
[TABLE]
Inserting this relation into (2.1) and recalling (1.7) we finally obtain
[TABLE]
where
[TABLE]
2.1 Conditions involving a sign of
A natural first idea to deduce global optimality from (2.2) consists in identifying situations in which for all . We have the following result:
Theorem 2.1**.**
Suppose that there exists an interval such that is convex (concave) on for almost all . Furthermore, assume that for every the solution with in satisfies for all . If a.e. on , then is the unique global minimum of .
Proof.
Suppose that is convex. Then our assumptions imply that
[TABLE]
which yields that since a.e. in . Hence for by (2.2).
In general we cannot expect the adjoint variable to have a sign without additional conditions on the data of the problem. The following result is similar in spirit to a sufficient condition involving a suitable bound on obtained in [25, Theorem 5.4] and [22, Section 5.2] for the optimal control of the obstacle problem.
Lemma 2.2**.**
Suppose that and that . Let satisfy
[TABLE]
Then in for every . Also, if a.e. in , then in .
Proof.
Let and set . If we test (1.5) with we have
[TABLE]
using (1.3), the fact that as well as . We infer that and hence in . Next, satisfies
[TABLE]
Testing with then gives in . Finally, since , the adjoint state satisfies
[TABLE]
since by what we have already shown. We infer that in a similar way as above.
Example 2.3**.**
Let with a.e. in . Then the functions and are convex on and respectively. Hence if and and are chosen as in Lemma 2.2, then Theorem 2.1 and Lemma 2.2 imply that a solution of the necessary first order conditions will be the unique global minimum of .
2.2 Conditions involving a bound on
As mentioned above it will in general not be possible to establish a sign on the adjoint variable , so that one is left with trying to bound in terms of . In what follows we shall assume that there exists and such that
[TABLE]
for almost all and for all . Note that (2.4) holds with if is globally Lipschitz uniformly in . Furthermore, it is not difficult to verify that (2.4) is satisfied with provided that (1.9) holds.
Example 2.4**.**
Let , where and with a.e. in . Then, satisfies (2.4) with and .
In what follows we shall make use of the elementary inequality (see e.g. [2, Lemma 7.1])
[TABLE]
as well as of the Gagliardo–Nirenberg interpolation inequality
[TABLE]
where and if and if . Explicit values for the constant in (2.6) can e.g. be found in [26] and [29], see also [2, Theorem 7.3].
Before we state our main result we mention that it is well–known that for all . In particular we infer with the help of a standard embedding result that
[TABLE]
Furthermore, we have that
[TABLE]
In order to see (2.8) we note that by elliptic regularity theory if . On the other hand, if with we may apply Theorem 3.1 and Section 4.2 in [11] to obtain that .
Theorem 2.5**.**
Assume that satisfies (2.4) and let be a solution of (1.5)–(1.8). Furthermore, choose such that
[TABLE]
and define for and the quantity
[TABLE]
where is the constant in (2.6). If the inequality
[TABLE]
is satisfied, then is a global minimum for Problem . If the inequality (2.11) is strict, then is the unique global minimum. The assertions hold for and provided that or with .
Proof.
To begin, note that (2.7) and (2.8) imply that for the cases that we consider. Our starting point is again (2.2) in which we write the remainder term as
[TABLE]
We claim that for all we have
[TABLE]
where L_{\gamma}=M\bigl{(}\frac{1-\gamma}{2-\gamma}\bigr{)}^{1-\gamma}. To see this, let us suppress temporarily the dependence on and introduce
[TABLE]
where is a sequence of mollifiers satisfying
[TABLE]
Since we have that
[TABLE]
so that we obtain with the help of (2.4) and Hölder’s inequality
[TABLE]
We may therefore apply Lemma 7.2 in [2] for to deduce that
[TABLE]
but the above estimate easily extends to the case . The bound (2.2) now follows by sending . If we insert (2.2) into (2.12) we find that
[TABLE]
where we have used Hölder’s inequality with exponents and . Note that
[TABLE]
in view of our assumptions on . We may therefore use (2.6) in order to estimate and obtain with
[TABLE]
that
[TABLE]
Applying (2.5) with and and recalling that we may continue
[TABLE]
If we take the difference of the PDEs satisfied by and and test it with we easily deduce that
[TABLE]
which yields
[TABLE]
Using once more (2.5), this time with we finally deduce that
[TABLE]
If we use this estimate in (2.2) and recall (2.10) as well as L_{\gamma}=M\bigl{(}\frac{1-\gamma}{2-\gamma}\bigr{)}^{1-\gamma} we infer that provided that (2.11) holds, so that is a global solution of problem . If the inequality in (2.11) is strict, then is the unique global minimum of problem .
Remark 2.6**.**
Suppose that and that satisfies (1.9) for some , so that (2.4) holds with . If we set , then satisfies (2.9) while and , so that Theorem 1.1 is a special case of Theorem 2.5.
3 Variational discretization
In this section we consider the case and let be an admissible triangulation of . We introduce the following spaces of linear finite elements:
[TABLE]
The Lagrange interpolation operator is defined by
[TABLE]
where denote the nodes in the triangulation and is the set of basis functions of the space which satisfy . We discretize (1.1), (1.2) using numerical integration for the nonlinear part: for a given , find such that
[TABLE]
Using the monotonicity of and the Brouwer fixed-point theorem one can show that (3.1) admits a unique solution . The variational discretization (see [18]) of Problem then reads:
[TABLE]
where . It can be shown that has a solution, provided that a feasible point exists. In practice, candidates for solutions are calculated by solving the system of necessary first order conditions which reads: find such that and
[TABLE]
In order to formulate the analogue of Theorem 2.5 we introduce the following –dependent norm on :
[TABLE]
Theorem 3.1**.**
Suppose that and satisfy the conditions (2.4) and (2.9) respectively and let , , , be a solution of (3.2)–(3.5). If
[TABLE]
then is a global minimum for Problem . If the inequality (3.6) is strict, then is the unique global minimum.
Proof.
Just as in the continuous case we obtain for with
[TABLE]
where
[TABLE]
If we use (2.2) then we obtain as above with the help of Hölder’s inequality
[TABLE]
where . Applying Lemma 5.1 in the Appendix we derive
[TABLE]
which is the analogue of (2.2). The rest of the proof now follows in the same way as in Theorem 2.5, where we use (3.1) instead of the PDEs.
We shall investigate condition (3.6) for different choices of and in the numerics section. From the numerical analysis point of view it is also possible to examine the convergence of a sequence of solutions of (3.2)–(3.5) that satisfy (3.6) uniformly in . Based on Theorem 1.1, convergence in of to a solution of has been obtained in [2, Theorem 4.2], while an error estimate is proved in [1, 3]. We expect that these results carry over to the generalized framework considered in this paper. In this context we also refer to [27] as a further contribution to the error analysis for optimal control of semilinear equations with pointwise bounds on the state. Contrary to our approach this work is based on second order sufficient optimality conditions for a local solution of the control problem and requires in particular a –nonlinearity .
4 Numerical experiments
In this section we conduct several numerical experiments related to Theorem 3.1. We consider with different choices for the nonlinearity . For each choice we fix , while for the desired state we consider the following two scenarios:
A1: (Reachable desired state) .
A2: (Not reachable desired state) .
For the control and state bounds we consider these three cases:
Case 1: (Unconstrained problem) , .
Case 2: (Control constrained problem) , .
Case 3: (State constrained problem) , .
For we report numerical results for the values , . The domain is partitioned using a uniform triangulation with mesh size , and the discrete counterpart of the problem is as in Section 3. The resulting discrete optimality system (3.2)–(3.5) is solved using the semismooth Newton method.
Example 4.1**.**
We consider . Then, with . Taking , the condition reads
[TABLE]
with
[TABLE]
The results are reported in Figure 1. We see that in the light of Theorem 3.1, the unique global solution of the considered control problem has been computed for all given values of , except for case 2 when . There, no conclusion can be derived. However, with the coefficient we obtain a global unique solution for the whole considered parameter range, see Fig. 2.
Example 4.2**.**
We consider . Then, with . Taking , the condition reads
[TABLE]
with
[TABLE]
The choice of is motivated by fact that among the possible choices of the Gagliardo-Nirenberg constant the value of is among the smallest possible ones, see [2, Figure 4]. The integrals involving , and the norm are computed exactly. The results are reported in Figure 3. We for comparison also include the results for which correspond to the findings of [2, Example 2]. As one can see this choice in some situations delivers larger uniqueness intervalls for . Overall, uniqueness of the global solution can be deduced for certain ranges of the parameter , where it is more likely in the case of a reachable desired state .
Example 4.3**.**
We consider . Then, with . Taking , the condition reads
[TABLE]
with
[TABLE]
The choice of is motivated as in the previous example. This then is the situation of [2, Example 3]. For comparison we also include the results obtained with quadrature based on the estimate (3.6). As one can see the differences in both approaches (exact integration versus quadrature) is negligible. The results are reported in Figure 4.
5 Appendix
Lemma 5.1**.**
Let and . Then
[TABLE]
Proof.
Let us denote by the unit simplex with vertices and . Using a scaling argument it is sufficient to show that
[TABLE]
where and . In order to see the first inequality in (5.1) we observe that
[TABLE]
in view of the convexity of and the properties of . Let us next consider the remaining estimate and first focus on the case . A straightforward calculation shows that
[TABLE]
which implies that
[TABLE]
Let us introduce the measure with . Clearly,
[TABLE]
Now, (5.2) yields that , while , so that the Riesz–Thorin convexity theorem implies that
[TABLE]
which is (5.1).
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] A. Ahmad Ali, Optimal Control of Semilinear Elliptic PD Es with State Constraints - Numerical Analysis and Implementation , Ph D thesis, Dissertation, Hamburg, Universität Hamburg, 2017.
- 2[2] A. Ahmad Ali, K. Deckelnick and M. Hinze, Global minima for semilinear optimal control problems, Computational Optimization and Applications , 65 (2016), 261–288.
- 3[3] A. Ahmad Ali, K. Deckelnick and M. Hinze, Error analysis for global minima of semilinear optimal control problems, Mathematical Control and related Fields (MCRF) 8 (2018).
- 4[4] N. Arada, E. Casas and F. Tröltzsch, Error estimates for the numerical approximation of a semilinear elliptic control problem, Computational Optimization and Applications , 23 (2002), 201–229.
- 5[5] E. Casas, Boundary control of semilinear elliptic equations with pointwise state constraints, SIAM Journal on Control and Optimization , 31 (1993), 993–1006.
- 6[6] E. Casas, Error estimates for the numerical approximation of semilinear elliptic control problems with finitely many state constraints, ESAIM: Control, Optimisation and Calculus of Variations , 8 (2002), 345–374.
- 7[7] E. Casas, Necessary and sufficient optimality conditions for elliptic control problems with finitely many pointwise state constraints, ESAIM: Control, Optimisation and Calculus of Variations , 14 (2008), 575–589.
- 8[8] E. Casas, J. C. De Los Reyes and F. Tröltzsch, Sufficient second-order optimality conditions for semilinear control problems with pointwise state constraints, SIAM Journal on Optimization , 19 (2008), 616–643.
