∎
[email protected] 22institutetext: 1 Departamento de Matemática, Universidad Técnica Federico Santa María, Av. España 1680, Valparaíso, Chile.
A Posteriori Error Estimates for an Optimal Control Problem with a Bilinear State Equation
Abstract
We propose and analyze a posteriori error estimators for an optimal control problem that involves an elliptic partial differential equation as state equation and a control variable that enters the state equation as a coefficient; pointwise constraints on the control variable are considered as well. We consider two different strategies to approximate optimal variables: a fully discrete scheme in which the admissible control set is discretized with piecewise constant functions and a semi-discrete scheme where the admissible control set is not discretized; the latter scheme being based on the so-called variational discretization approach. We design, for each solution technique, an a posteriori error estimator and show, in two and three dimensional Lipschitz polygonal/polyhedral domains (not necessarily convex), that the proposed error estimator is reliable and efficient. We design, based on the devised estimators, adaptive strategies that deliver optimal experimental rates of convergence for the performed numerical examples.
Keywords:
optimal control problems bilinear equations finite elements a posteriori error estimates adaptive finite element methodsMSC:
49M25 65N15 65N30 65N501 Introduction
The development and study of discretization techniques, based on finite elements, for distributed control–constrained linear–quadratic elliptic optimal control problems have been widely studied in the literature; see MR2843956; MR2516528 for an extensive list of references. These discretization techniques are mainly divided into two categories, which rely on the discretization of the state and adjoint equations; they differ on whether or not the admissible control set is also discretized. In contrast to these advances, the study of solution techniques for optimal control problems where the control variable enters the state equation as a coefficient is not as developed. One of the main sources of difficulty within these type of problems is that the solution of the state equation depends nonlinearly on the control variable MR2536007. Consequently, uniqueness of solutions cannot be guaranteed.
In this work, we will focus on the development and analysis of efficient solution techniques for the optimal control problem (2)–(4), which incorporates the control variable as a coefficient in the state equation; the control variable is not a source term. We immediately mention that this problem can be interpreted as a particular instance of parameter estimation. To the best of our knowledge, the first work that provides an analysis for suitable finite element discretizations for problem (2)–(4) is MR2536007. In this work, the authors propose, on convex polygonal/polyhedral domains and quasi–uniform meshes, two fully discrete schemes that discretize the admissible control set with piecewise constant and piecewise linear functions; the state and adjoint equations are discretized with piecewise linear functions. Estimates for the error committed within the approximation of a control variable are derived in (MR2536007, Corollaries 5.6 and 5.10). In addition, an error estimate for a post-processing strategy is obtained in (MR2536007, Theorem 5.18). The results obtained in MR2536007 were later extended to mixed and stabilized finite element methods in MR3103238 and MR3693332, respectively.
A particular class of numerical methods that has proven a competitive performance when are used to approximate solutions to PDE–constrained optimization problems, and the ones we shall consider in this work, are adaptive finite element methods (AFEMs). AFEMs are iterative methods recognizable by their capability to improve the quality of a discrete approximation to a corresponding PDE while keeping an efficient distribution of computational resources. A crucial component of an AFEM is an a posteriori error estimator, which is a computable quantity, depending on the problem data and discrete solution, that provides local information about the quality of the approximate solution. The a posteriori error analysis for control–constrained linear–quadratic optimal control problems has achieved several advances in recent years. We refer the interested reader to MR1887737; MR1780911; MR2434065; MR3212590; MR3621827; MR4122501 for a discussion. As opposed to these advances, the analysis of AFEMs for optimal control problems involving nonlinear or bilinear equations is rather scarce. To the best of our knowledge, the work MR2680928 appears to be the first that provides a posteriori error estimates for (2)–(4). In this work, the authors develop a posteriori error estimators for two fully discrete approximation schemes of (2)–(4) and obtain global reliability estimates (MR2680928, Theorems 4.1 and 4.3) and global efficiency results (MR2680928, Lemmas 4.2 and 4.3). We also mention the work MR3174031, where a posteriori error estimates for a parabolic version of (2)–(4) have been analyzed; an efficiency analysis, however, was not provided. We conclude this paragraph by mentioning the work MR2373479, where the authors provide, on the basis of a posteriori error estimators, upper bounds for discretization errors with respect to a cost functional and with respect to a given quantity of interest; the latter being an arbitrary functional depending on the control and the state variables. In our work, we derive upper and lower bounds for the approximation error when is measured in an energy norm; see below for a discussion.
In the present manuscript, we consider two different strategies to discretize the optimal control problem (2)–(4): a semi-discrete scheme, based on the so-called variational discretization approach MR2122182, in which the admissible control set is not discretized, and a fully discrete scheme, where control variables are approximated by using piecewise constant functions. We devise, for each one of the aforementioned schemes, a residual–based a posteriori error estimator. For the fully discrete scheme the error estimator is formed by the sum of three contributions: two of them are related to the discretization of the state and adjoint equations while the remaining one is related to the discretization of the admissible control set. In contrast, the error estimator for the variational discretization approach is formed by only two contributions that are related to the discretization of the state and adjoint equations. In two and three dimensional Lipschitz polygonal/polyhedral domains (not necessarily convex), we obtain reliability and efficiency estimates.
In what follows we list what, we believe, are the main contributions of our work:
-
•
For the fully and semi-discrete schemes that we consider, we devise a posteriori error estimators; both being different from the ones in MR2680928 and MR2373479.
-
•
For the aforementioned solution techniques, we prove that the corresponding local error indicators associated to the discretization of the state and adjoint equations are locally efficient. This analysis improves the global one in (MR2680928, Lemmas 4.2 and 4.3). We also prove that the total error indicator associated to the variational discretization approach is locally efficient (cf. Theorem LABEL:thm:global_eff_var); the one associated to the fully discrete scheme, as customary, being globally efficient (cf. Theorem LABEL:thm:global_eff).
-
•
We design a simple adaptive loop that delivers optimal experimental rates of convergence for all the involved individual contributions of the corresponding error. The loop based on the a posteriori error indicators devised for the variational discretization approach delivers quadratic rates of convergence for the error approximation of a control variable. This substantially improves the approximation properties that can be achieved by the considered fully discrete scheme. The indicators devised for the latter scheme tend to refine the involved meshes in regions where the restrictions of the control variable become active. These DOFs seem not necessary for an accurate approximation of control variables. An scheme based on piecewise linear approximation of the admissible control set would suffer the same limitations in terms of avoidable refinement MR4122501.
The rest of the paper is organized as follows. In section 2 we introduce the optimal control problem under consideration and set notation. Basic results for the state equation as well as basic a posteriori error estimates are reviewed in section 3. In section 4 we review the existence of solutions for the optimal control problem as well as first and second order optimality conditions. The crucial part of our work are sections 5 and LABEL:sec:a_posteriori_semi, where we design and analyze a posteriori error estimators for the fully and semi-discrete schemes, respectively. Finally, in section LABEL:sec:numerical_ex we present numerical examples in two and three dimensional domains that illustrate the theory and reveal a competitive performance of the devised AFEMs.
2 The Problem and Notation
Let us precisely introduce the optimal control problem that will be considered in our work, set notation, and describe the setting we shall operate with.
2.1 Presentation of the Problem
In this work we are interested in the design and analysis of a posteriori error estimates for an optimal control problem governed by an elliptic partial differential equation (PDE) as state equation. Our main source of difficulty here is that the control variable enters the state equation as a coefficient; control constraints are also considered. Let us make this discussion precise. Let , with , be an open and bounded polygonal/polyhedral domain with Lipschitz boundary (MR2424078, Chapter 4). Given a desired state and a regularization parameter , let us introduce the cost functional
(1) |
We are thus interested in the following optimal control problem: Find
(2) |
subject to the elliptic PDE
(3) |
where denotes an external source, and the control constraints
(4) |
Here, satisfy .
2.2 Notation
Let us set notation and describe the setting we shall operate with. Throughout this work and is an open and bounded polygonal/polyhedral domain with Lipschitz boundary (MR2424078, Chapter 4). Notice that we do not assume that is convex. If and are normed vector spaces, we write to denote that is continuously embedded in . We denote by the norm of . The relation indicates that , with a positive constant that depends neither on , nor on the involved discretization parameters. The value of might change at each occurrence.
3 The State Equation
In this section, we briefly review some results related to the well-posedness of problem (3). Additionally, we present a posteriori error estimates for a specific finite element setting.
3.1 Weak Formulation
Let be a given forcing term in and be an arbitrary function in . With this setting at hand, we introduce the following weak problem:
(5) |
Lax–Milgram Theorem immediately yields the well-posedness of problem (5). In particular, we have the following stability estimate
3.2 Finite Element Approximation
In this section, we introduce a basic finite element approximation for the weak problem (5) and review basic a posteriori error estimates. To accomplish this task, we first introduce some terminology and further basic ingredients.
We denote by a conforming partition of into simplices with size and define . We denote by the set of internal -dimensional interelement boundaries of . For , we let denote the subset of which contains the sides of the element . We denote by the subset that contains the two elements that have as a side, namely, , where are such that . For , we define the star associated with the element as
(6) |
In an abuse of notation, below we denote by either the set itself or the union of its elements.
We define, for , the shape coefficient of as the ratio of the diameter, i.e., , and the inball diameter of , i.e., . The shape coefficient of a triangulation corresponds to the quantity . A sequence of triangulations , that is obtained by subsequent refinements of an initial mesh , is shape regular if ; see (Nochetto_etal2009, section 3.2.1) for details.
Given a mesh , we define the finite element space of continuous piecewise linear functions as
(7) |
Given a discrete function , we define, for any internal side , the jump or interelement residual by
where denote the unit normals to pointing towards , , respectively. Here, , are such that and .
3.3 An a Posteriori Error Estimate for the State Equation
We introduce the following local error indicators and a posteriori error estimator associated to the discretization (8) of problem (5):
We present the following global reliability result.
Theorem 3.1 (global reliability of )
Let and be given. Let be the unique solution to problem (5) and let be its finite element approximation obtained as the solution to (8). We thus have
with a hidden constant that is independent of , , the size of the elements in , and but depends on the shape coefficient of the triangulation , i.e., , and the dimension .
Proof
Since solves (5), we invoke Galerkin orthogonality and an elementwise integration by parts formula to arrive at
Here, and denotes the Clément interpolation operator MR2373954; MR0520174. Standard approximation properties for and the finite overlapping property of stars allow us to derive
Set and use the fact that to conclude. ∎
4 The Optimal Control Problem
In this section, we follow (MR2536007, section 2) and introduce a weak formulation for the optimal control problem (2)–(4). In addition, we review first and second order optimality conditions and introduce finite element discretization schemes.
4.1 Weak Formulation and Existence of a Solution
4.2 Optimality Conditions
Due to the fact that the optimal control problem (9)–(10) is not convex, we discuss optimality conditions under the framework of local solutions in . To be precise, a control is said to be locally optimal in for (9)–(10) if there exists a constant such that for all such that . Here, and denote the states associated to and , respectively.
Let us introduce the set . We immediately notice that . Having defined , we introduce the control-to-state map as follows: given a control , associates to it a unique state solving (10). With these ingredients at hand, we define the reduced cost functional by
We are now in position to formulate first order optimality conditions: if is locally optimal for problem (9)–(10), then (MR2536007, Proposition 2.10)
(11) |
Here, denotes the Gateâux derivative of the functional at in the direction . We notice that, for , (MR2536007, equation (2.6)) and immediately comment that and are not Fréchet differentiable with respect to the -topology (MR2536007, Remark 2.8). To investigate the inequality (11), we introduce the adjoint variable as the unique solution to the adjoint equation
(12) |
With the previous ingredients at hand, we reformulate first order optimality conditions as follows; see (MR2536007, Proposition 2.10 and equation (2.6)).
Theorem 4.1 (first order optimality conditions)
Let us now introduce the projection operator as
(14) |
This operator allows us to present the following projection formula (MR2536007, equation (2.7)): If denotes a locally optimal control for (9)–(10), then
(15) |
Let be a control that satisfies the first order necessary optimality condition (13). In what follows, we will assume that there exists a constant such that
(16) |
see (MR2536007, Assumption 2.20). Here, for each , we have that
where and are defined as in (MR2536007, Lemma 2.9). We notice that assumption (16) is fulfilled if is sufficiently small or is sufficiently large; see (MR2536007, Remark 2.21) for details.
The following result states that every control that satisfies (13) and (16) is a local solution for problem (9)–(10); see (MR2536007, Theorem 2.24).
Theorem 4.2 (local optimality)
We conclude this section with the following estimate (MR2536007, Proposition 2.22): Let and . Then, there exists , depending on and , such that
(17) |
4.3 Finite Element Approximation
In this section, we introduce two finite element discretization schemes for our optimal control problem.
4.3.1 The Fully Discrete Scheme
To approximate a control variable, we introduce the space of piecewise constant functions
and define the discrete admissible set . The state and adjoint state variables, associated to a locally optimal control, are discretized by using the finite element space defined in (7). With this setting at hand, the fully discrete scheme reads as follows: Find subject to the discrete state equation
(18) |
for all and the discrete constraints . The fully discrete scheme admits at least a solution; see (MR2536007, Section 3) for details. In addition, if denotes a discrete local solution, then
where is such that
(19) |
for all ; see (MR2536007, equations (3.6) and (3.7)).
4.3.2 The Semi-discrete Scheme
In this section, we introduce the so-called variational discretization approach for (9)–(10). This scheme discretizes only the state space; the control space is not discretized. The scheme induces a discretization of an optimal control variable by projecting, in view of the operator introduced in (14), an optimal discrete adjoint state into . The semi-discrete scheme is defined as follows: Find subject to the discrete state equation
(20) |
for all and the constraints . As in the fully discrete case, this problem admits at least a solution and, if denotes a local solution, then
where solves
(21) |
for all . Here, solves (20) with .
5 A Posteriori Error Analysis for the Fully Discrete Scheme
In this section, we devise and analyze an a posteriori error estimator for the fully discrete scheme. The error estimator will be formed by the sum of three contributions: two contributions related to the discretization of the state and adjoint equations and a one contribution associated to the discretization of the admissible control set .
To begin with our studies we introduce, on the basis of the projection operator defined in (14), the auxiliary variable
(22) |
A key property in favor of the definition of is that it satisfies the following variational inequality (Troltzsch, Lemma 2.26):
(23) |
With the variable at hand, we present the following result which is instrumental for our a posteriori error analysis.
Theorem 5.1 (auxiliary estimate)
Let be a local solution to (9)–(10) satisfying the sufficient second order optimality condition (16). Let be a local minimum of the fully discrete optimal control problem with and being the corresponding state and adjoint state, respectively. If and satisfy, on the mesh , the bound
(24) |
then
(25) |
The constants and are given as in (16) and (17), respectively.