Abstract
We consider an optimal control problem subject to a semilinear elliptic PDE together with its variational discretization. We provide a condition which allows to decide whether a solution of the necessary first order conditions is a global minimum. This condition can be explicitly evaluated at the discrete level. Furthermore, we prove that if the above condition holds uniformly with respect to the discretization parameter the sequence of discrete solutions converges to a global solution of the corresponding limit problem. Numerical examples with unique global solutions are presented.
Similar content being viewed by others
References
Arada, N., Casas, E., Tröltzsch, F.: Error estimates for a semilinear elliptic control problem. Comput. Optim. Appl. 23, 201–229 (2002)
Casas, E.: Boundary control of semilinear elliptic equations with pointwise state constraints. SIAM J. Control Optim. 31, 993–1006 (1993)
Casas, E.: Error estimates for the numerical approximation of semilinear elliptic control problems with finitely many state constraints. ESAIM Control Optim. Calc. Var. 8, 345–374 (2002)
Casas, E., Mateos, M.: Uniform convergence for the FEM. Applications to state constrained control problems. Comput. Appl. Math. 21, 67–100 (2002)
Casas, E., Tröltzsch, F.: Second order optimality conditions and their role in PDE control. Jahresbericht der Deutschen Mathematiker-Vereinigung (2014). doi:10.1365/s13291-014-0109-3
Casas, E., de los Reyes, J.C., Tröltzsch, F.: Sufficient second order optimality conditions for semilinear control problems with pointwise state constraints. SIAM J. Optim. 19(2), 616–643 (2008)
Casas, E., Mateos, M., Vexler, B.: New regularity results and improved error estimates for optimal control problems with state constraints. ESAIM Control Optim. Calc. Var. 20(3), 803–822 (2014)
Deckelnick, K., Hinze, M.: A Finite Element Approximation to Elliptic Control Problems in the Presence of Control and State Constraints. Hamburger Beiträge zur Angewandten Mathematik 2007-01. Universität Hamburg, Hamburg (2007)
Del Pino, M., Dolbeault, J.: Best constants for Gagliardo-Nirenberg inequalities and applications to nonlinear diffusions. J. Math. Pures Appl. 81, 847–875 (2002)
Hintermüller, M., Ito, K., Kunisch, K.: The primal-dual active set strategy as a semismooth Newton method. SIAM J. Optim. 13, 865–888 (2002)
Hinze, M.: A variational discretization concept in control constrained optimization: The linear-quadratic case. Comput. Optim. Appl. 30, 45–61 (2005)
Hinze, M., Rösch, A.: Discretization of optimal control problems. Int. Ser. Numer. Math. 160, 391–431 (2011)
Hinze, M., Pinnau, R., Ulbrich, M., Ulbrich, S.: Optimization with PDE Constraints. Mathematical Modelling: Theory and Applications, vol. 23. Springer, Dordrecht (2008)
Leykekhman, D., Vexler, B.: Finite Element Pointwise Results on Convexpolyhedral Domains. TU München, München (2015)
Nasibov, S.M.: On optimal constants in some Sobolev inequalities and their application to a nonlinear Schrödinger equation. Soviet. Math. Dokl. 40, 110–115 (1990), translation of Dokl. Akad. Nauk SSSR 307, 538–542 (1989)
Neitzel, I., Pfefferer, J., Rösch, A.: Finite element discretization of state-constrained elliptic optimal control problems with semilinear state equation. SIAM J. Control Optim. 53(2), 874–904 (2015)
Rannacher, Rolf, Scott, Ridgway: Some optimal error estimates for piecewise linear finite element approximations. Math. Comput. 38(158), 437–445 (1982)
Ulbrich, M.: Semismooth Newton methods for operator equations in function spaces. SIAM J. Optim. 13(3), 805–841 (2002)
Veling, E.J.M.: Lower bounds for the infimum of the spectrum of the Schrödinger operator in \({\mathbb{R}}^N\) and the Sobolev inequalities. JIPAM J. Inequal. Pure Appl. Math. [electronic only], 3, Art. 63 (2002)
Author information
Authors and Affiliations
Corresponding author
Appendix
Appendix
Lemma 7.1
We have for \(a,b \ge 0, \lambda ,\mu >0\) that
Proof
Apply Young’s inequality \( xy \le \tfrac{1}{P} \, x^P + \tfrac{1}{Q} \, y^Q \, x,y \ge 0, \, \tfrac{1}{P}+\tfrac{1}{Q}=1\) to \(P=\frac{\lambda + \mu }{\lambda }\), \(Q=\frac{\lambda + \mu }{\mu }\) and \(x= \left( P a \right) ^{\frac{1}{P}}, \, y= \left( Q b \right) ^{\frac{1}{Q}}\). \(\square \)
Lemma 7.2
Suppose that Assumption 1 holds. Then we have for \(a,b \in {\mathbb {R}}\)
where
Proof
We start by noticing that
Therefore, taking the absolute value and using Assumption 1 we get
where \(\tfrac{1}{r}+\tfrac{1}{r'}=1\). It is easy to see that
Denoting \(M \Vert 1-t \Vert _{L^{r'}(0,1)}\) by \(L_r\) completes the proof. \(\square \)
Theorem 7.3
(Gagliardo–Nirenberg interpolation inequality)
For \(2 \le q < \infty \) we define \(\mu =1-\frac{2}{q}\) as well as
Then \(GN_q \le C_q{:}= \min (C^{(1)}_q,C^{(2)}_q,C^{(3)}_q)\), where
Here,
Proof
The bounds (7.1) and (7.2) can be found in the paper [19] by Veling. We remark that \(GN_q=\lambda _{2,\mu }^{-1}\), where \(\lambda _{2,\mu }\) is defined in [19, (1.7)]. The estimate (7.1) is [19, (1.31)] (note that \(\mu \ge \frac{1}{2} \Leftrightarrow q \ge 4\)), while (7.2) is [19, (1.42), (1.43)], where the latter bound has been proved by Nasibov in [15].
Let us now turn to the proof of (7.3). To begin, we claim that for all \(k \in {\mathbb {N}}_0\)
where
The inequality clearly holds for \(k=0\). Suppose that (7.4) is true for some \(k \in {\mathbb {N}}_0\). We infer from Theorem 1 in [9] for the case \(d=2\) that
Here,
Using the formula for y and observing that \(\Gamma (y)= (y-1) \Gamma (y-1)\), the expression for A can be simplified to
We apply (7.5) for \(p=\frac{1}{2} q_k\) and obtain
where
Since \(\frac{1}{2} q_k+1= q_{k+1}\) we find that
which, inserted into (7.6) yields
Using the induction hypothesis we infer
Elementary calculations show that
which implies (7.4) for \(k+1\). The result now follows by sending \(k \rightarrow \infty \) in (7.4) and by observing that \(\lim _{k \rightarrow \infty } q_k = 2\). \(\square \)
Figure 4 illustrates the values of the constants (7.1)–(7.3) for a certain range of q, namely, \(2 \le q \le 10\) for \(C_q^{(2)},C_q^{(3)}\) and \(4 \le q \le 10\) for \(C_q^{(1)}\). We can see clearly that the values of \(C_q^{(1)}\) are smaller than those of \(C_q^{(2)},C_q^{(3)}\) for approximately \(q \ge 6\). In order to derive a computable upper bound on \(C_q^{(3)}\) we note that \(\frac{2^j}{2^j+q-2} \le 1\) for \(j\in {\mathbb {N}}\), and therefore
where \(k_0\ge 2\) is chosen so large that \(2^{k_0}+2-q\ge 0\). In our calculations we used \(k-1=200\). All the computations of these constants are done using Mathematica 8.
Rights and permissions
About this article
Cite this article
Ahmad Ali, A., Deckelnick, K. & Hinze, M. Global minima for semilinear optimal control problems. Comput Optim Appl 65, 261–288 (2016). https://doi.org/10.1007/s10589-016-9833-1
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10589-016-9833-1
Keywords
- Optimal control
- Semilinear PDE
- Uniqueness of global solutions
- Second order sufficient condition
- Gagliardo–Nirenberg inequality