Discontinuous Galerkin Methods for an Elliptic Optimal Control Problem with a General State Equation and Pointwise State Constraints
Abstract.
We investigate discontinuous Galerkin methods for an elliptic optimal control problem with a general state equation and pointwise state constraints on general polygonal domains. We show that discontinuous Galerkin methods for general second-order elliptic boundary value problems can be used to solve the elliptic optimal control problems with pointwise state constraints. We establish concrete error estimates and numerical experiments are shown to support the theoretical results.
Key words and phrases:
elliptic distributed optimal control problems, general state equations, pointwise state constraints, discontinuous Galerkin methods1991 Mathematics Subject Classification:
49J20, 49M41, 65N30, 65K151. Introduction
Let be a polygonal domain in , , be a positive constant and . The elliptic optimal control problem is to find
(1.1) |
where belongs to if and only if
(1.2) | ||||
and the pointwise state constraint
(1.3) |
where the function
(1.4) |
The bilinear form is defined as,
(1.5) |
where the vector field and the function is nonnegative. If , then the constraint (1.5) is the weak form of a general second order PDE with an advective/convective term. We assume
(1.6) |
such that the problem (1.2) is well-posed.
Here and throughout the paper we will follow the standard notation for differential operators, function spaces and norms that can be found for example in [28, 17].
We define the subspace of as
(1.7) |
where . We also denote
(1.8) |
Due to the elliptic regularity [29, 41], is a subspace of for some , where if is convex, and
(1.9) |
It follows from (1.9) and the Sobolev inequality [1, Theorem 4.12] that . Therefore we can reformulate (1.1)-(1.3) as the following,
(1.10) |
where
(1.11) |
Optimal control problems with pointwise state constraints are more difficult to analyze due to the low regularity of the Lagrange multiplier. In [18, 24], the authors proved that the Lagrange multiplier is a nonnegative Borel measure and at the same time. By using this regularity result, the pointwise state constraints can then be handled.
In the case and , the distributed optimal control problem with pointwise state constraints (1.1)-(1.3) is investigated in [20, 24, 40, 39, 43, 26, 35, 37] using finite element methods. Several extensions [16, 14] to the new approach in [20] have been established. Other methods are proposed for (1.1)-(1.3), for example, interior penalty methods [11, 22], Morley finite element methods [13], and virtual element methods [21]. Fast solvers for (1.1)-(1.3) are also studied in [15, 10]. We refer to [9] for a more detailed survey about finite element methods for (1.1)-(1.3). Overall, as pointed out in [9], optimal control problems with pointwise state constraints can be analyzed using known finite element methods for fourth order boundary value problems. This crucial observation opens doors to many possible numerical methods for optimal control problems with pointwise state constraints.
Recently, discontinuous Galerkin (DG) methods for (1.1)-(1.3) with and were proposed and analyzed in [12] where a new interior maximum estimate [19] was utilized. For the general case where and , a continuous finite element method was proposed and analyzed in [14]. The goal of this paper is to extend the results in [12, 14] to an optimal control problem with a general state equation (1.1)-(1.3). The reason for using a DG method is to enable a fast solution of the discrete problem by the primal-dual active algorithm that converges superlinearly (see Remark 3.2). Since the bilinear form (1.3) is nonsymmetric, we must employ an adjoint consistent [3] method (3.12) in order to obtain estimates involving and which are key ingredients in the convergence analysis.
The rest of the paper is organized as follows. In Section 2, we gather some known regularity results for the continuous problem (1.1)-(1.3). These results are useful in the convergence analysis. In Section 3, we propose mixed discontinuous Galerkin methods to solve the problem (1.1)-(1.3) and establish some important properties of the discrete problem. Three crucial operators , and are defined and analyzed in Section 4. Concrete error estimates are established in Section 5. Numerical results are provided in Section 6 and we end with some concluding remarks in Section 7. A description of the primal-dual active set algorithm is given in Appendix A and the proofs of Lemma 3.3 and Lemma 4.3 are provided in Appendix B.
Throughout this paper, we use (with or without subscripts) to denote a generic positive constant that is independent of any mesh parameters. Also to avoid the proliferation of constants, we use the notation (or ) to represent . The notation is equivalent to and .
2. The Continuous Problem
By the classical theory of variation of calculus, it is well-known that there exists a unique solution to (2.1). Consequently, the problem (1.10) has a unique solution and can be characterized by
(2.3) |
Interior regularity of
By the interior regularity results for fourth order variational inequalities [32, 33], we have . Since , which is a subspace of by the Sobolev inequality, we conclude
(2.4) |
A proof can be found in [14].
Lagrange multiplier
Taking in (2.3) where is a nonnegative function in . Thus we have
(2.5) |
It follows from [44, Section 13, Theorem 25] or [45, Theorem 2.14] that
(2.6) |
where
(2.7) |
Furthermore, it can be proved [18, 24] that
(2.8) |
and we have the following complimentarity condition
(2.9) |
Regularity of and global regularity of
3. The Discrete Problem
Let be a shape regular simplicial triangulation of . The diameter of is denoted by and is the mesh diameter. Let where (resp. ) represents the set of interior edges (resp. boundary edges).
We further decompose the boundary edges into the inflow part and the outflow part which are defined as follows,
(3.1) | ||||
(3.2) |
For an edge , let be the length of . For each edge we associate a fixed unit normal . We denote by the element for which is the outward normal, and the element for which is the outward normal. We define the discontinuous finite element space as
(3.3) |
For on an edge , we define
(3.4) |
We define the jump and average for on an edge as follows,
(3.5) |
For with , we let
(3.6) |
We also denote
(3.7) |
3.1. Mixed discontinuous Galerkin methods
We define the piecewise space with as
(3.8) |
Define as
(3.9) | ||||
where
(3.10) |
Here
(3.11) | ||||
is the bilinear form of the symmetric interior penalty (SIP) method with sufficiently large penalty parameter and
(3.12) |
is the unstabilized DG scheme for advection and reaction terms (cf. [23] and [30, Section 2.2]).
Remark 3.1.
We do not consider convection-dominated case in this paper. Therefore the bilinear form does not contain any stabilization terms. However, if one considers convection-dominated case, the following well-known [38, 4] upwind scheme can be utilized,
(3.13) |
where the upwind value of a function on an interior edge is defined as
(3.14) |
Then the discrete problem for (1.10) is to find
(3.15) |
where
(3.16) |
Here is the set of vertices of . Note that we impose the Dirichlet boundary condition weakly through .
Remark 3.2.
The discrete problem (3.15)-(3.16) can be solved by a primal-dual active set method (see Appendix A). Let denote the mass matrix represent the bilinear form with respect to the natural discontinuous nodal basis in . Note that the computation of involves . In contrast to [20, 16, 14], the matrix is block diagonal hence can be obtained easily.
3.2. Properties of
Let be a subdomain of and be a collection of all the elements with a nonempty intersection with . Define a mesh-dependent norm on ,
(3.17) |
We use to denote the norm if there is no ambiguity. The following lemma establishes the continuity and coercivity of , which is standard for the discontinuous Galerkin methods [3, 42, 17]. The proof is provided in Appendix B.
Lemma 3.3.
We have
(3.18) | |||||
(3.19) |
for large enough .
3.3. Properties of
By the definition of and integration by parts, we have for any
(3.20) | ||||
which gives the consistency of . Moreover, we have
(3.21) |
where is the orthogonal projection from onto .
3.4. Discrete variational inequalities
Define as
(3.22) |
Note that we have the following,
(3.23) |
In particular, we have
(3.24) |
4. Preliminary Estimates
In this section, we establish some preliminary estimates for the convergence analysis. We consider both quasi-uniform meshes and graded meshes [7, 5, 2] around reentrant corners.
4.1. Graded Meshes
For a nonconvex domain with reentrant corners, it is well-known that the solution to the state equation (1.2) does not belong to in general (see (2.10)). To overcome this lack of regularity, we can use a triangulation with the following properties. Let be the interior angles at the corners of the bounded polygonal domain and be the center of . There exists constants and such that
(4.1) |
where . Here the grading parameters are chosen as,
(4.2) | ||||
The construction of graded meshes that satisfy (4.1) can be found in [7, 5, 2].
4.2. Preliminary inequalities
The following standard inequalities [3, 42, 12] are needed. Assume is a subdomain of such that , i.e., the closure of is a compact set of . Note that is quasi-uniform around for graded meshes. Then a standard inverse estimate implies
(4.3) |
We also have the following discrete Sobolev inequality [12]
(4.4) |
For and where , the following trace inequalities with scaling is standard (cf. [31, Lemma 7.2] and [27, Proposition 3.1]),
(4.5) | ||||
(4.6) |
The following discrete Poincaŕe inequality for DG functions [8, 4, 25] is valid for all ,
(4.7) |
4.3. Interpolation operator
Let be the conforming finite element space associated with . We use the usual continuous nodal interpolant (which belongs to ) [3, 42] such that the following holds.
Lemma 4.1.
We have
(4.8) |
For quasi-uniform or graded meshes, we also have
(4.9) |
The following lemma is useful in the convergence analysis.
Lemma 4.2.
Let be a function with compact support in . We have
(4.11) |
4.4. The Ritz Projection Operator
We define an operator as the following,
(4.14) |
It follows from (3.9), (3.21) and (4.14) that
(4.15) |
Moreover, we have, by (3.22),
(4.16) |
Lemma 4.3.
We have the following error estimates for ,
(4.17) | ||||
(4.18) |
Proof.
The proof can be found in Appendix B. ∎
4.5. The Smoothing Operator
The operator is defined by
(4.21) |
In particular, for all ,
(4.22) |
Note that (4.22) and (4.14) imply
(4.23) |
Lemma 4.4.
We have the following estimates for all
(4.24) | ||||
(4.25) | ||||
(4.26) |
where is an open neighborhood of the active set such that the closure of is a compact subset of .
4.6. The Connection Operator
We need a connection operator defined as follows,
(4.27) |
where is any node of the finite element space interior to and is the set of triangles in that share the node . The operator has the following properties by (3.16) and (4.27),
(4.28) | ||||
(4.29) |
For any subdomain of , we have,
(4.30) |
where belongs to if and only if . Here (the star of ) is the union of all the triangles in that share a common vertex with . We also have (cf. [12])
(4.31) |
It follows from (4.26) and (3.17) that,
(4.32) |
Remark 4.5.
Due to the facts that and , the operator is utilized to connect the discrete problem with the continuous problem.
5. Convergence Analysis
In this section, we derive error estimates of the discontinuous Galerkin methods (3.15). We define a mesh-dependent norm
(5.1) |
5.1. An abstract error estimate
Let be the solution of (3.15). Given any , we have the following by (3.25) and (3.23),
(5.2) | ||||
Notice that , we then obtain, by (2.6), (4.21) and (3.21),
(5.3) | ||||
It follows from (4.25) that
(5.4) |
For the last term in (5.3), we have the following lemma.
Lemma 5.1.
We have, for any ,
(5.5) |
where is independent of and is the active set.
Proof.
We give a sketch of the proof. The details can be found in [12, Theorem 4.1]. We have, by (3.16) and (2.7),
(5.6) | ||||
We can bound , and as follows. It follows from (2.7), (3.16) and (4.29) that
(5.7) |
We also have
(5.8) | ||||
and
(5.9) |
by (1.4), (2.7), (2.9) and (2.4). For , it follows from (2.8), (4.26), (4.30) and (4.32) that
(5.10) |
Finally, we obtain
(5.11) |
Remark 5.2.
5.2. Concrete error estimates
Lemma 5.3.
Proof.
We give a sketch of the proof. The details can be found in [12, Lemma 5.1]. The crucial task here is to construct a suitable to bound the infimum in (5.12). Let be an open neighborhood of the active set and . We then define as the following,
(5.14) |
where is a nonnegative function with compact support in such that on . We can show that . Hence, it follows from Lemma 4.2, (4.18) and (4.16) that
(5.15) | ||||
(5.16) |
Therefore, we obtain, by (5.1) and (4.19),
(5.17) |
At last, it follows from (4.31), (4.28), (4.19) and (4.8) that,
(5.18) |
∎
6. Numerical Results
In this section we report the numerical results from two examples. The discrete problem (3.15) is solved by a primal-dual active set algorithm [6, 36]. For all examples, we take the penalty parameter and the regularization parameter . For simplicity, we also take . We utilized the MATLAB\C toolbox FELICITY [46] in our computation.
Example 6.1 (Square Domain [14]).
For this example, we take , , and in (3.15). We consider the function defined as follows,
The function is given by
where
By construction, the function is the exact solution and . The active set is the unit disk . The convergence rates on uniform meshes are reported in Table 6. As we can see, the convergence rate is around (in average) for the and error of the state and for the error of the control. These are better than the estimates in Theorem 5.4 and consistent with the fact . We also observe convergence of the state in which is consistent with Theorem 5.4. See Figure 1 for the optimal state, control and active set at level 6.
Order | Order | Order | Order | |||||
---|---|---|---|---|---|---|---|---|
3.00e+01 | - | 3.14e+01 | - | 6.23e+01 | - | 8.45e+00 | - | |
1.02e+01 | 1.55 | 9.33e+00 | 1.75 | 2.66e+01 | 1.23 | 4.68e+00 | 0.85 | |
2.70e+00 | 1.92 | 3.34e+00 | 1.48 | 9.33e+00 | 1.51 | 9.50e-01 | 2.30 | |
7.45e-01 | 1.86 | 1.19e+00 | 1.48 | 3.54e+00 | 1.40 | 2.80e-01 | 1.76 | |
1.40e-01 | 2.41 | 4.30e-01 | 1.47 | 1.39e+00 | 1.35 | 5.03e-02 | 2.48 | |
6.74e-02 | 1.05 | 1.95e-01 | 1.14 | 5.59e-01 | 1.31 | 2.11e-02 | 1.25 | |
3.76e-02 | 0.84 | 9.58e-02 | 1.02 | 2.08e-01 | 1.43 | 1.28e-02 | 0.72 | |
7.18e-03 | 2.39 | 4.31e-02 | 1.15 | 6.75e-02 | 1.62 | 2.56e-03 | 2.32 |






Example 6.2 (L-shaped Domain [14]).
For this example, we take , and in (3.15). This example is a modification of Example 6.1. The functions and are shifted using the point . After that, a singular function is added to the functions and . By construction, the exact solution is where is defined in Example 6.1. Here the function is defined by
(6.1) | ||||
Tables 6 and 6 contain the convergence rates of the discontinuous Galerkin methods (3.15) on uniform meshes and graded meshes (see Figure 2). As we can see in Table 6, the convergence for the state in and norms is approaching . This coincides with the theoretical results with . The convergence of the state in norm is close to and the convergence of the control in norm is approaching . These are better than the estimates in Theorem 5.4 and consistent with the fact that and . We also observe clear improvements of the convergence rates for the state in and norms in Table 6. This also coincides with Theorem 5.4 with .
Order | Order | Order | Order | |||||
---|---|---|---|---|---|---|---|---|
3.30e+01 | - | 2.79e+01 | - | 6.79e+01 | - | 7.03e+00 | - | |
1.97e+01 | 0.75 | 2.39e+01 | 0.22 | 3.10e+01 | 1.13 | 6.73e+00 | 0.06 | |
7.34e+00 | 1.42 | 1.52e+01 | 0.65 | 9.37e+00 | 1.73 | 4.90e+00 | 0.46 | |
2.02e+00 | 1.86 | 8.82e+00 | 0.79 | 3.31e+00 | 1.50 | 3.08e+00 | 0.67 | |
5.09e-01 | 1.99 | 4.66e+00 | 0.92 | 1.27e+00 | 1.39 | 1.88e+00 | 0.71 | |
1.38e-01 | 1.88 | 2.44e+00 | 0.93 | 4.99e-01 | 1.35 | 1.15e+00 | 0.71 | |
4.76e-02 | 1.54 | 1.33e+00 | 0.87 | 1.81e-01 | 1.47 | 7.15e-01 | 0.69 | |
1.10e-02 | 2.12 | 7.64e-01 | 0.80 | 5.82e-02 | 1.63 | 4.47e-01 | 0.68 |
Order | Order | Order | Order | |||||
---|---|---|---|---|---|---|---|---|
2.13e+01 | - | 2.94e+01 | - | 3.09e+01 | - | 6.78e+00 | - | |
1.14e+01 | 0.91 | 2.66e+01 | 0.15 | 2.49e+01 | 0.31 | 5.07e+00 | 0.42 | |
4.18e+00 | 1.44 | 1.78e+01 | 0.58 | 4.66e+00 | 2.42 | 2.55e+00 | 0.99 | |
1.04e+00 | 2.01 | 9.67e+00 | 0.88 | 1.77e+00 | 1.40 | 9.81e-01 | 1.38 | |
2.52e-01 | 2.04 | 4.55e+00 | 1.09 | 8.51e-01 | 1.05 | 3.15e-01 | 1.64 | |
6.75e-02 | 1.90 | 2.03e+00 | 1.16 | 3.74e-01 | 1.19 | 1.50e-01 | 1.07 | |
3.24e-02 | 1.06 | 9.06e-01 | 1.17 | 1.66e-01 | 1.17 | 5.93e-02 | 1.34 | |
3.99e-03 | 3.02 | 4.14e-01 | 1.13 | 5.49e-02 | 1.59 | 2.80e-02 | 1.08 |
7. Concluding Remark
We propose and analyze discontinuous Galerkin methods to solve an optimal control problem with a general state equation and pointwise state constraints on general polygonal domains. Concrete error estimates are established and numerical results are provided to support the theoretical results. We do not consider convection-dominated case in this paper, hence the constants throughout this paper might depend on and . However, we would like to point out that the potential of our methods is to solve optimal control problems governed by convection-dominated equations with pointwise state constraints. There are some previous work [38, 34] concerning the optimal control problems governed by convection-dominated problems without state constraints. As pointed out in [38], the weak treatment of the Dirichlet boundary conditions (as we did in (3.9)) are crucial for optimal control problems governed by convection-dominated equations. However, rigorous analysis of the convection-dominated case seems nontrivial. We will investigate this in future work.
Appendix A Primal-dual active set algorithm
Now we rewrite (3.15) in matrix and vector form. Let (resp., ) denote the mass (resp., stiffness) matrix represent the bilinear form (resp., ) with respect to the natural discontinuous nodal basis in . Assume represents and represents the boundary integral term in (3.9). It follows from (3.9) that
(A.1) |
where . This leads to the relation
(A.2) |
and
(A.3) |
Thus (3.15) can be rewritten as, by (A.2) and (A.3),
(A.4) | ||||
Denote and . Let , the primal-dual active set method for (A.4) is the following.
-
•
Given an initial guess where , we define
-
•
For we recursively solve the system
(A.5) (A.6) (A.7) -
•
Then update the active set and inactive set by
The unique solution of (A.5)-(A.7) is determined by
(A.8) | |||||
Remark A.1.
Here we follow the MATLAB convention that the vector is the subvector of generated by the components of corresponding to the index set , the matrix is the submatrix of generated by the rows and columns of corresponding to the index set , etc.
Appendix B Proofs of Lemma 3.3 and Lemma 4.3
Proof of Lemma 3.3.
Proof of Lemma 4.3.
It follows from (3.18), (3.19), (4.14) and (4.8) that
(B.3) | ||||
which implies
(B.4) |
Hence we have (4.17) by triangle inequality. The estimate (4.18) is established by a duality argument. Let be defined by
(B.5) | ||||||
The weak form of the dual problem (B.5) is to find such that
(B.6) |
By elliptic regularity (1.9), we have
(B.7) |
It follows from (B.5) that,
(B.8) | ||||
By the adjoint consistency of the SIP method, we have
(B.9) |
It follows from integration by parts that
(B.10) | ||||
The last term can be rewritten as the following [3, 30],
(B.11) | ||||
It then follows from on internal edges and on that
(B.12) |
According to (B.10)-(B.12), we conclude
(B.13) |
which implies the following together with (B.9),
(B.14) |
Therefore, it follows from (B.14), (4.14), (4.8), (3.18) and (B.7) that
(B.15) | ||||
We then obtain the estimate (4.18) combining (4.17) and (B.15).
∎
Acknowledgement
The authors would like to thank Prof. Susanne C. Brenner and Prof. Li-Yeng Sung for the suggestion and discussion regarding this project. The work of the third author was partially supported by the National Science Foundation under grant DMS-2111004.
References
- [1] R. A. Adams and J. J. F. Fournier. Sobolev Spaces, volume 140. Elsevier, 2003.
- [2] T. Apel, A.-M. Sändig, and J. R. Whiteman. Graded mesh refinement and error estimates for finite element solutions of elliptic boundary value problems in non-smooth domains. Mathematical methods in the Applied Sciences, 19(1):63–85, 1996.
- [3] D. N. Arnold, F. Brezzi, B. Cockburn, and L. Marini. Unified analysis of discontinuous galerkin methods for elliptic problems. SIAM Journal on Numerical Analysis, 39(5):1749–1779, 2002.
- [4] B. Ayuso and L. D. Marini. Discontinuous galerkin methods for advection-diffusion-reaction problems. SIAM Journal on Numerical Analysis, 47(2):1391–1420, 2009.
- [5] I. Babuška. Finite element method for domains with corners. Computing, 6(3):264–273, 1970.
- [6] M. Bergounioux and K. Kunisch. Primal-dual strategy for state-constrained optimal control problems. Computational Optimization and Applications, 22(2):193–224, 2002.
- [7] J. J. Brannick, H. Li, and L. T. Zikatanov. Uniform convergence of the multigrid V-cycle on graded meshes for corner singularities. Numerical Linear Algebra with Applications, 15(2-3):291–306, 2008.
- [8] S. C. Brenner. Poincaré–Friedrichs inequalities for piecewise functions. SIAM Journal on Numerical Analysis, 41(1):306–324, 2003.
- [9] S. C. Brenner. Finite element methods for elliptic distributed optimal control problems with pointwise state constraints (survey). Advances in Mathematical Sciences, pages 3–16, 2020.
- [10] S. C. Brenner, C. B. Davis, and L.-Y. Sung. Additive Schwarz preconditioners for a state constrained elliptic distributed optimal control problem discretized by a partition of unity method. In Domain Decomposition Methods in Science and Engineering XXV 25, pages 100–107. Springer, 2020.
- [11] S. C. Brenner, J. Gedicke, and L.-Y. Sung. interior penalty methods for an elliptic distributed optimal control problem on nonconvex polygonal domains with pointwise state constraints. SIAM Journal on Numerical Analysis, 56(3):1758–1785, 2018.
- [12] S. C. Brenner, J. Gedicke, and L.-Y. Sung. A symmetric interior penalty method for an elliptic distributed optimal control problem with pointwise state constraints. Computational Methods in Applied Mathematics, 2023.
- [13] S. C. Brenner, T. Gudi, K. Porwal, and L.-Y. Sung. A Morley finite element method for an elliptic distributed optimal control problem with pointwise state and control constraints. ESAIM: Control, Optimisation and Calculus of Variations, 24(3):1181–1206, 2018.
- [14] S. C. Brenner, S. Liu, and L.-Y. Sung. A finite element method for a distributed elliptic optimal control problem with a general state equation and pointwise state constraints. Computational Methods in Applied Mathematics, 21(4):777–790, 2021.
- [15] S. C. Brenner, S. Liu, and L.-Y. Sung. Multigrid methods for an elliptic optimal control problem with pointwise state constraints. Results in Applied Mathematics, 17:100356, 2023.
- [16] S. C. Brenner, M. Oh, and L.-Y. Sung. finite element methods for an elliptic state-constrained distributed optimal control problem with Neumann boundary conditions. Results in Applied Mathematics, 8:100090, 2020.
- [17] S. C. Brenner and L. R. Scott. The Mathematical Theory of Finite Element Methods, volume 15. Springer Science & Business Media, 2008.
- [18] S. C. Brenner and L.-Y. Sung. A new convergence analysis of finite element methods for elliptic distributed optimal control problems with pointwise state constraints. SIAM Journal on Control and Optimization, 55(4):2289–2304, 2017.
- [19] S. C. Brenner and L.-Y. Sung. An interior maximum norm error estimate for the symmetric interior penalty method on planar polygonal domains. Computational Methods in Applied Mathematics, 2022.
- [20] S. C. Brenner, L.-Y. Sung, and J. Gedicke. finite element methods for an elliptic optimal control problem with pointwise state constraints. IMA Journal of Numerical Analysis, 11 2018.
- [21] S. C. Brenner, L.-Y. Sung, and Z. Tan. A virtual element method for an elliptic distributed optimal control problem with pointwise state constraints. Mathematical Models and Methods in Applied Sciences, 31(14):2887–2906, 2021.
- [22] S. C. Brenner, L.-Y. Sung, and Y. Zhang. A quadratic interior penalty method for an elliptic optimal control problem with state constraints. In Recent Developments in Discontinuous Galerkin Finite Element Methods for Partial Differential Equations, pages 97–132. Springer, 2014.
- [23] F. Brezzi, L. D. Marini, and E. Süli. Discontinuous galerkin methods for first-order hyperbolic problems. Mathematical models and methods in applied sciences, 14(12):1893–1903, 2004.
- [24] E. Casas, M. Mateos, and B. Vexler. New regularity results and improved error estimates for optimal control problems with state constraints. ESAIM: Control, Optimisation and Calculus of Variations, 20(3):803–822, 2014.
- [25] Z. Chen and H. Chen. Pointwise error estimates of discontinuous Galerkin methods with penalty for second-order elliptic problems. SIAM Journal on Numerical Analysis, 42(3):1146–1166, 2004.
- [26] S. Cherednichenko and A. Rösch. Error estimates for the discretization of elliptic control problems with pointwise control and state constraints. Computational Optimization & Applications, 44(1), 2009.
- [27] P. Ciarlet. Analysis of the Scott–Zhang interpolation in the fractional order sobolev spaces. Journal of Numerical Mathematics, 21(3):173–180, 2013.
- [28] P. G. Ciarlet. The Finite Element Method for Elliptic Problems, volume 19. 1978.
- [29] M. Dauge. Elliptic boundary value problems on corner domains. Lecture Notes in Mathematics, 1341:1, 1988.
- [30] D. A. Di Pietro and A. Ern. Mathematical Aspects of Discontinuous Galerkin Methods, volume 69. Springer Science & Business Media, 2011.
- [31] A. Ern and J.-L. Guermond. Finite element quasi-interpolation and best approximation. ESAIM: Mathematical Modelling and Numerical Analysis, 51(4):1367–1385, 2017.
- [32] J. Frehse. Zum differenzierbarkeitsproblem bei variationsungleichungen höherer ordnung. In Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg, volume 36, pages 140–149. Springer, 1971.
- [33] J. Frehse. On the regularity of the solution of the biharmonic variational inequality. Manuscripta Mathematica, 9(1):91–103, 1973.
- [34] M. Heinkenschloss and D. Leykekhman. Local error estimates for SUPG solutions of advection-dominated elliptic linear-quadratic optimal control problems. SIAM Journal on Numerical Analysis, 47(6):4607–4638, 2010.
- [35] M. Hintermüller and M. Hinze. Moreau–Yosida regularization in state constrained elliptic control problems: Error estimates and parameter adjustment. SIAM Journal on Numerical Analysis, 47(3):1666–1683, 2009.
- [36] M. Hintermüller, K. Ito, and K. Kunisch. The primal-dual active set strategy as a semismooth Newton method. SIAM Journal on Optimization, 13(3):865–888, 2002.
- [37] M. Hintermüller, A. Schiela, and W. Wollner. The length of the primal-dual path in Moreau–Yosida-based path-following methods for state constrained optimal control. SIAM journal on optimization, 24(1):108–126, 2014.
- [38] D. Leykekhman and M. Heinkenschloss. Local error analysis of discontinuous galerkin methods for advection-dominated elliptic linear-quadratic optimal control problems. SIAM Journal on Numerical Analysis, 50(4):2012–2038, 2012.
- [39] W. Liu, W. Gong, and N. Yan. A new finite element approximation of a state-constrained optimal control problem. Journal of Computational Mathematics, pages 97–114, 2009.
- [40] C. Meyer. Error estimates for the finite-element approximation of an elliptic control problem with pointwise state and control constraints. Control and Cybernetics, 37:51–83, 2008.
- [41] S. Nazarov and B. A. Plamenevsky. Elliptic Problems in Domains with Piecewise Smooth Boundaries, volume 13. Walter de Gruyter, 2011.
- [42] B. Rivière. Discontinuous Galerkin Methods for Solving Elliptic and Parabolic Equations: Theory and Implementation. SIAM, 2008.
- [43] A. Rösch and D. Wachsmuth. A-posteriori error estimates for optimal control problems with state and control constraints. Numerische Mathematik, 120(4):733–762, 2012.
- [44] H. L. Royden and P. Fitzpatrick. Real Analysis, volume 32. Macmillan New York, 1988.
- [45] W. Rudin. Real and Complex Analysis. Tata McGraw-Hill Education, 2006.
- [46] S. W. Walker. FELICITY: A MATLAB/C++ toolbox for developing finite element methods and simulation modeling. SIAM Journal on Scientific Computing, 40(2):C234–C257, 2018.