Abstract
In this paper, we address density properties of intersections of convex sets in several function spaces. Using the concept of Γ-convergence, it is shown in a general framework, how these density issues naturally arise from the regularization, discretization or dualization of constrained optimization problems and from perturbed variational inequalities. A variety of density results (and counterexamples) for pointwise constraints in Sobolev spaces are presented and the corresponding regularity requirements on the upper bound are identified. The results are further discussed in the context of finite-element discretizations of sets associated with convex constraints. Finally, two applications are provided, which include elasto-plasticity and image restoration problems.
1. Introduction
Convex constraint sets K as subsets of an infinite-dimensional Banach space X are common to many fields in mathematics such as calculus of variations, variational inequalities and control theory. Such constraints are induced by physical limitations of control and/or state variables, but also emerge through Fenchel dualization of convex problems; e.g. [1–3] for fundamental concepts in variational analysis. In this vein, given a set of functions satisfying an arbitrary convex constraint, density properties of more regular functions satisfying the same restriction are of utmost importance. In abstract terms, given some dense subspace Y of X, the central point of interest is whether the closure property
with K(Y)={u∈Y :u∈K}=K∩Y , is fulfilled, and how this problem is intimately linked to the solution of constrained optimization and variational inequality problems.
In the literature, problems of dense intersections appear in connection with the discretization of variational inequality problems in Sobolev spaces and the convergence analysis for finite-element methods under minimal regularity (e.g. [4–6]). Moreover, the limiting behaviour of singular perturbations of elliptic variational inequalities can be traced back to the density issue (see [7] and references therein). This also pertains to the deduction of a vanishing viscosity limit for hyperbolic variational inequalities with an obstacle constraint [8]. In the context of plasticity problems, certain density properties represent an important step towards the determination of appropriate relaxed formulations (cf. [9,10]). However, to the best of our knowledge, the investigation of problem (1.1) is restricted to special cases and the literature still lacks a general and systematic treatment of the density issue.
To motivate the study of the abstract problem (1.1), §2 provides a novel unifying framework for various perturbation approaches to non-smooth constrained optimization and variational inequality problems. The general setting includes regularization, Galerkin approximation and singular perturbations, and, most remarkably, it allows to reduce the study of the corresponding limit problems for a wide range of practically relevant perturbations to the study of the density property (1.1). In particular, we prove that the dense intersection (1.1) is a necessary and sufficient stability condition for the retrieval of the original problem in the (joint) limit of vanishing regularization and/or discretization parameters.
Starting from §3 we focus on the setting where X=X(Ω) is a (-valued) vector space of functions over a bounded domain Ω of and K=K(X) denotes the subset of elements in X(Ω) bounded pointwise by a prescribed measurable function , i.e.
In order to close this gap, we prove new density results for continuous obstacles (§4), and we also consider different classes of discontinuous obstacles. In fact, in §4a, the density issue is studied in the context of the regularity of the obstacle as a Sobolev function. More precisely, we prove that results of the type (1.1) cannot be expected if the obstacle is just a Sobolev function by providing a counterexample. The density results are then proved to be valid even for certain classes of lower semicontinuous obstacles; see §4b,c. Subsequently, in §4d, a different approach is considered for obstacles that originate from the solution of a partial differential equation (PDE).
In §5, we focus on the Mosco convergence of finite-element discretized convex sets, which, in general, is a delicate matter, and only a limited number of results for more regular obstacles are known (e.g. [4,5]). In this respect, the construction of a recovery sequence essentially reduces to the verification of density properties of the type (1.1). Making use of the density results provided by the preceding sections, we prove several new Mosco convergence results in the Hilbert spaces L2,H1 and H(div) for different types of finite-element discretizations of K, even for discontinuous obstacles α. The results are extended to a more general constraint setting involving pointwise restrictions on partial derivatives. We conclude the paper by presenting two important applications that further highlight the paramount significance of dense intersections. First, we consider the regularization of an elasto-plastic contact problem, where the closure property turns out to be fundamental for the efficient solution by a semismooth Newton method. Secondly, we discuss an example from total variation-based image restoration with a distributed non-smooth regularization parameter. Here, the density property arises as an essential condition for the equivalent reformulation of the problem in the Hilbert space H(div) by means of Fenchel duality.
2. Motivation
(a) Optimization with convex constraints
In many variational problems, one seeks the solution in a given convex, closed and non-empty subset K of an infinite-dimensional Banach space (X,∥.∥). To illustrate the problem, let us consider the following abstract class of optimization problems:
(i) A class of quasi-monotone perturbations
To subsume as many of the above-mentioned methods as possible, we consider the sequence of perturbed problems
The first main result of this section states that the dense intersection property implies the stability of any quasi-monotone perturbation scheme. The proof is deferred to appendix A.
Let the Banach space X be reflexive or assume that the dual space X* is separable. For a closed, convex and non-empty set K⊂X, let (Rn) be a sequence of quasi-monotone perturbations of iK with respect to the dense subspace Y according to (2.2). If the density property (1.1) holds true, then F+iK is the Γ-limit of (F+Rn) in both, the weak and strong topology.Theorem 2.1 (Sufficient condition)
Under the assumptions of theorem 2.1, one may infer that, provided each problem (2.2) admits a global minimizer un, each weak cluster point of the sequence of minimizers (un) is a global minimizer of (2.1); see [12] for an introduction to Γ-convergence. At the end of this section, it is further clarified that theorem 2.1 is sharp in the sense that the stability result in general fails if (1.1) does not hold. We also remark that in case the (sequential) weak and strong Γ-limits coincide, one usually uses the notion Mosco convergence.
In the following, we present a selection of approximation methods that fit into the general class of perturbations defined by (2.2), which bear high practical relevance. In favour of generality, we do not leave the abstract setting.
Let (Y,∥…∥Y) be a Banach space which is densely and continuously embedded into X. For a sequence of positive non-decreasing parameters (γn) with and fixed α>0, consider in (2.2) the Tikhonov regularization
Example 2.2 (Tikhonov regularization)
Let X be a separable Banach space. Suppose (2.1) is approximated by a Galerkin approach using nested and conforming finite-dimensional subspaces Xn, i.e. Xn⊂X and Xn⊂Xn+1 for all , such that the Galerkin approximation property
Example 2.3 (Conforming discretization)
Let X be a Hilbert space and (Y,∥…∥Y) be a Banach space that is densely and continuously embedded into X. For two sequences of positive non-decreasing parameters (γn),(γn′) with and fixed α>0, consider the simultaneous Moreau–Yosida and Tikhonov regularization
Example 2.4 (Combined Moreau–Yosida/Tikhonov regularization)
Let X be a separable Hilbert space and (γn) a sequence of positive non-decreasing parameters converging to . The combination of regularization and discretization leads to the definition
Example 2.5 (Conforming discretization and Moreau–Yosida regularization)
Consequently, each of these perturbations is stable with respect to (2.1) provided the density result (1.1) is satisfied. It should also be emphasized that these examples only represent an assorted variety of perturbations that fit into the problem class (2.2).
Moreover, the density property (1.1) is also a necessary condition for the stability of perturbation schemes in the following sense: first, the Γ-limit of the approximation schemes defined in examples 2.2 and 2.3 can be calculated using similar arguments as in the proof of theorem 2.1. In fact, under the same conditions on X, one obtains as the weak and strong Γ-limit in both cases. Secondly, in the combined approaches of examples 2.4 and 2.5, theorem 2.1 guarantees that F+iK is obtained as the weak-strong Γ-limit for any coupling of regularization parameter pairs [γn,γn′] and [Xn,γn], respectively. Let us put this statement into a perspective by means of the combined Galerkin/Moreau–Yosida approach (example 2.5). In this case, it is possible to prove the existence of a suitable combination of n and γn to recover F+iK in the Γ-limit without resorting to the density property (1.1), see [13], Prop. 2.4.6. However, the proof is non-constructive and thus not immediately useful for the design of a stable numerical algorithm. On the other hand, if (1.1) is violated, the Γ-convergence to the original problem (2.1) cannot be guaranteed independently from the choice of the regularization/discretization parameter pair. In fact, the following result, which we prove in appendix A, holds true.
Consider example 2.5 with the corresponding definitions ofYand (Rn). Further suppose that. Then for allthere exists a strictly increasing sequence (γn) withsuch thatProposition 2.6 (Necessary condition)
The analogous statement is valid in the case of combined Moreau–Yosida/Tikhonov regularizations given a fixed sequence (γn′); cf. example 2.4. In conclusion, theorem 2.1 is sharp with respect to condition (1.1) in the sense of proposition 2.6 and the preceding discussion.
(b) Elliptic variational inequalities
The density of convex intersections of the type (1.1) is also of fundamental importance for the analysis of perturbations of variational inequalities. Assuming X to be a Hilbert space and K⊂X non-empty, closed and convex, we consider the general variational inequality problem of the first kind,
(i) Quasi-monotone perturbation
Consider the perturbed variational inequality problem,
(ii) Galerkin approximation of variational inequalities
In general, finite-dimensional approximations of K are neither conforming nor nested as it was the case in examples 2.3 and 2.5, where K was ‘discretized’ by K∩Xn, which is numerically realizable only in special cases. Instead, it is often more favourable to consider non-nested approximations Kn⊂Xn that may contain infeasible elements, such that Kn⊂K does not hold true in general [4,5]. As a result, the finite-dimensional variational inequality problems,
(iii) Singular perturbations
The closure property (1.1) also plays a role in the limiting behaviour of singular perturbations. In fact, let A1:Y →Y * be a Lipschitz continuous and strongly monotone operator on a Hilbert space (Y,∥…∥Y) that embeds densely and continuously into X. For a sequence of regularization parameters (γn) with consider the perturbed problems,
3. Density results for continuous obstacles
We first fix some notation. In this section, denotes a bounded Lipschitz domain. The space of functions that are restrictions to Ω of smooth functions with compact support on is denoted by ,
When considering the case X=W1,p instead of in (3.2), the choice of the approximating sequence from [11], Theorem 1, which relies on the trivial extension of Sobolev functions, fails. As a result, a different extension operator has to be employed.
Let fulfil (3.1) and . Then it holds that
Theorem 3.1
Let w∈K(W1,p(Ω)d). Since Ω is a bounded Lipschitz domain we may extend w to a function in using for each component the extension-by-reflection operator. The resulting operator
Proof.
(i) In order to incorporate a homogeneous Dirichlet boundary condition in the context of theorem 3.1, one may use an additional reparametrization to construct a suitable approximating sequence; see [11]. (ii) If the set K(W1,p(Ω)d) is additionally restricted by an inhomogeneous Dirichlet boundary condition given by a function g∈W1−1/p,p(∂Ω)d with |g(x)|≤α(x) on ∂Ω, the proof of theorem 3.1 fails. In fact, the sequence (3.8), which is based on the standard mollifier, does not preserve a given trace condition. In any case, the regularity of g (and ∂Ω) determines an a priori regularity limitation for the functions in Y in order to be compatible with a closure property analogous to (3.4), e.g. if and g∉C(∂Ω), then K∩Y =∅. In this case, a different mollification approach needs to be pursued; cf. also §7 for an outlook on this matter.Remark 3.2 (boundary conditions)
4. Density results for discontinuous obstacles
(a) Obstacles in Sobolev spaces
Note that theorem 3.1 requires continuous obstacles. In some applications, such as in the regularization and discretization of elasto-plastic contact problems or image restoration problems (see §6), it may be useful to consider obstacles that are not continuous. Under such circumstances, the following example shows that density properties of the type (3.2) or (3.4) cannot be expected if the obstacle is just a Sobolev function: without loss of generality, assume that with N≥2 and denote by
Assume that the latter implication is false. Then there exist as well as μ>0,δ>0 such that
An interesting point in the preceding counterexample is the structure of the set of singularities where g(x) is not well defined as a real number by the infinite sum (4.2), if φ from (4.1) is understood as a function in C(Ω∖{0}). Extending φ to Ω by setting , we obtain for all and, understanding as an extended real-valued function, we arrive at the following definition:
Remark 4.1 (Complements on the counterexample)
The previous construction of the counterexample is the basis for the following result.
Let be a bounded Lipschitz domain. The following density results hold true: (i) Let N≥2 and . Then there exists an obstacle satisfying (3.1) such thatTheorem 4.2
(ii) Let N≥2 and 1≤p≤N. Then there exists an obstacle satisfying (3.1) such that
(iii) Let or p=N=1. For any measurable obstacle function which satisfies (3.1), it holds that
We only prove assertion (iii) since (i) and (ii) follow immediately from (4.5) and (4.6). As a consequence of the Sobolev imbedding theorem, any w∈K(W1,p(Ω)d) is contained in . Let w∈K(W1,p(Ω)d). Setting
Proof.
We immediately infer the corresponding statements for Sobolev spaces incorporating homogeneous Dirichlet boundary conditions.
Letbe a bounded Lipschitz domain. The following density results hold true:
(i) LetN≥2 andp≤N. Then there exists an obstaclesatisfying (3.1) such thatCorollary 4.3
(ii) Letorp=N=1. For any measurable obstacle functionwhich satisfies (3.1) it holds that
(i) Define the upper bound α by (4.3). Let be a smooth cut-off function with and except on a sufficiently small neighbourhood of ∂Ω. Then it holds that and the assertion now follows directly from the discussion preceding remark 4.1. (ii) Taking account of (3.2), statement (ii) can be proven as theorem 4.2 (iii). ▪Proof.
(b) Lower semicontinuous obstacles and Lebesgue spaces
The preceding counterexample provides a regularity limit in terms of the upper bound α for which the density property (3.2) in the space X(Ω)=Lp(Ω)d can be expected to hold. In this regard, however, uniform continuity is far from being a necessary condition. In order to enlarge the space of obstacles compatible with (3.2), we first consider upper bounds that allow for a lower semicontinuous representative, i.e. there exists a lower semicontinuous function in the equivalence class of functions that are Lebesgue-almost everywhere equal to α.
Let be a bounded Lipschitz domain and . If has a lower semicontinuous representative that fulfils (3.1), then it holds that
Theorem 4.4
Let w∈K(Lp(Ω)d). Consider a lower semicontinuous function that fulfils (3.1). Without loss of generality, we may assume that . Denote by the extension of α given by , on , and note that is lower semicontinuous (l.s.c.) on . The Lipschitz regularization of ,
Proof.
We proceed by considering the important special case of a piecewise continuous upper bound; suppose there exists a partition of Ω into open subsets Ωl⊂Ω with Lipschitz boundary such that , Ωi∩Ωj=∅ for i≠j and
(c) Lower semicontinuous obstacles and Sobolev spaces
Conditions on the obstacle α so that the density results for Sobolev spaces hold can be relaxed from assuming that to lower regularity requirements with the aid of Mosco convergence of closed and convex sets. The following definition goes back to [15].
Let X be a reflexive Banach space and (Kn) a sequence of closed convex subsets with Kn⊂X for all . Then Kn→MK as , i.e. (Kn) is said to Mosco converge to the set K⊂X, if and only if
Definition 4.5 (Mosco convergence)
Here, (Knk) denotes an arbitrary subsequence of (Kn) and the subset notation (vk)⊂X has to be understood in the sense that {vk}⊂X. The following class of obstacles encompasses functions in W1,q(Ω) that fulfil a generalized lower semicontinuity condition.
We denote by for q≥1 the set of functions α∈W1,q(Ω) for which there exists a sequence of functions (αn) with αn satisfying (3.1), αn≤α a.e. in Ω and for all such that in W1,q(Ω).Definition 4.6
Note that the class is strictly contained in W1,q(Ω). Additionally, any obstacle has a lower semicontinuous representative, which follows easily from definition 4.6 and by extraction of a pointwise almost everywhere converging subsequence. However, the functions in are not necessarily continuous: it suffices to consider the example from (4.1) for Ω=Br(0), N>1 and
Let be a bounded Lipschitz domain. Let and . Then the following density results hold true:
Theorem 4.7
Without loss of generality, consider the one-dimensional case d=1. Let and (αn)⊂W1,p(Ω) according to definition 4.6. By Mazur's lemma, we may as well assume that (αn) converges strongly to α in W1,p(Ω) since convex combinations preserve order and continuity. Hence, one obtains the Mosco convergence result
Proof.
(d) Supersolutions of elliptic partial differential equations
By now, density properties for pointwise constraints in Sobolev spaces of the type
Let Ω be a bounded domain. Let α∈H1(Ω) be a weak supersolution for some A as in (4.11) in the sense of (4.12), with α≥0 on ∂Ω. For , it holds that
(i) or aij∈C1(Ω): , (ii) ∂Ω∈C1,1 or Ω convex, : , (iii) aij,bi,c∈Cm+1(Ω), : and (iv) ∂Ω∈Cm+2, , : .Theorem 4.8
Without loss of generality, assume d=1. First observe that the maximum principle implies α(x)≥0 a.e. in Ω. Let w∈K(X(Ω)) be arbitrary. Consider the sequence (wn), where wn is defined as the unique solution to the problem,
Proof.
Step 1: Tn-invariance of : We now prove that for any , we have that −α≤wn≤α a.e., i.e.
Step 2: Some convergence results for singular perturbations.
The desired convergence modes of the approximating sequences rely on standard arguments for singular perturbations, cf. [7], Theorems 9.1 and 9.4 for the case of singularly perturbed variational inequalities. First, for y∈L2(Ω) it holds
Thirdly, in addition to wn=Tn(w), we define where for , and . It can be deduced from (4.15) and (4.16) by induction that
Step 3: Regularity and convergence of the approximating sequences
The extra regularity of the -solution Tn(w) to (4.13) is different with respect to the statement cases: if or aij∈C1(Ω) for 1≤i,j≤N, the solution Tn(w) belongs to (see [21] for the first case and [18] for the second one). The solution Tn(w) belongs to if ∂Ω is C1,1-smooth [21] or when Ω is convex [22].
In case w∈K(L2(Ω)), (4.15) with yn≡w ensures that wn→w in L2(Ω). In conjunction with the regularity and the feasibility of wn=Tn(w) described above, we have then established (i) and (ii) for X(Ω)=L2(Ω). Secondly, note that if , then wn→w in by (4.16) with yn≡w, and as seen above, . This, together with the regularity of wn=Tn(w) established above, proves in turn (i) and (ii) for .
It is left to argue for (iii) and (iv) as follows. If aij,bi,c∈Cm+1(Ω) for 1≤i,j≤N, then for each , the operator Tn has the following increasing regularity properties [18],
Let us briefly comment on the relation to the density results from theorem 4.4 and theorem 4.7. First, note that we do not require the obstacle to be bounded away from zero as we did in the preceding paragraphs. Secondly, the maximal regularity of the feasible approximation hinges on the coefficients of the elliptic operator associated with the obstacle and the smoothness of the boundary. Concerning the semicontinuity requirements of the upper bound, a classical result from Trudinger [23], Cor. 5.3 for the case without lower order terms (bi≡0,c≡0) states that any weak supersolution in the sense of (4.12) is upper semicontinuous. By contrast, the consideration of upper bounds that are weak subsolutions of an elliptic PDE is not useful as these functions may easily fail to be non-negative on Ω. For example, this is the case if a weak subsolution satisfies a Dirichlet boundary condition.
5. Application to finite elements
(a) Finite-element discretized convex sets
In the following, we investigate the issue of the Mosco convergence (definition 4.5) of finite-dimensional approximations Kn of a convex constraint set K(X(Ω)) of the type (3.3); see §2b(ii) for a general motivation in the context of variational inequality problems. In this section, it is assumed that the sets (Kn) result from a suitable finite-element discretization such that the parameter n is associated with a sequence of mesh widths (hn) tending to zero. The convergence of (Kn) in the sense of definition 4.5 ensures that the solutions of the discrete problems converge to the solution of the original infinite-dimensional problem irrespectively of the regularity of the data or the obstacle defining K(X(Ω)); see [7], ch. 4, Theorem 4.1. Mosco convergence results of this type are rarely found in the literature and are typically confined to simpler constraint sets and higher regularity assumptions on the obstacle; see, for instance, [4] for the case of an -bound in the context of the obstacle problem. The density results from the preceding sections provide the basis for new Mosco convergence results under minimal regularity (of the solution) and under weaker assumptions on the regularity of the obstacle α. We further provide novel Mosco convergence results for discretized constraints on partial derivatives, including Raviart–Thomas finite-element approaches for problems in H(div). As a general rule, density results of the type (1.1) represent a powerful means to verify the convergence of finite-element methods for convex constrained problems under minimal regularity. Applications involving constraint sets of the type (3.3) with low regularity of α are manifold and comprise, for instance, the discretization of variational problems in mechanics, such as in elasto-plasticity with hardening [24], and in image restoration, with regard to the predual problem of TV-regularization [25]. Moreover, the issue occurs in fixed point-based approaches to the solution of quasi-variational inequalities through the implicit definition of obstacles.
In some textbooks on finite-dimensional approximations of variational inequalities, cf. e.g. [4,6], condition (M2) is replaced by the following criterion:
Remark 5.1
The condition (M2′) turns out to be convenient especially in the context of finite-dimensional approximations, where (rn) is given by suitable interpolation operators, which typically are only well defined on a dense subset Y (Ω) of X(Ω) giving rise to sets of the type K(Y (Ω)). This is precisely the point where the density results of §3 are needed.
Note that Mosco convergence is a powerful tool whenever the discrete spaces are fixed a priori, i.e. regardless of the data of the specific problem. The resulting sequence of finite-dimensional problems can be understood as an approximation of any problem in a given problem class.
By contrast, adaptive finite-element methods intend to design the sets Kn in order to approximate the solution of a specific problem. However, rigorous convergence proofs with regard to adaptive discretizations of variational inequalities are restricted to special cases and usually rely on rather strong assumptions. For instance, in the case of the obstacle problem with a piecewise affine obstacle, we mention the article [26]. Moreover, density results may still be useful in the convergence analysis of adaptive schemes which require interpolation operators (cf. [27]).
(b) Finite-element spaces and interpolation operators
In this section, we assume that is polyhedral. Together with Ω, a sequence of geometrically conforming affine simplicial meshes of Ω with mesh size
(c) Mosco convergence results under minimal regularity
We emphasize that the subsequent results may be extended to finite elements of higher order, which are typically useful when the solution to the variational problem, e.g. (2.8), displays a higher regularity. In this regard, higher regularity assumptions on the data and the obstacle are required and the concept of Mosco convergence is not binding to prove the convergence of the finite-element method, and a priori error estimates with a rate can be derived (cf. e.g. [30]). However, we do not want to deviate from minimal regularity assumptions on the data. Further, even for simple variational problems such as the classical elasto-plastic torsion problem, there is a regularity limitation for the solution regardless of the smoothness of the data (cf. [4]).
Note also that the subsequently covered problems comprise situations where the discrete feasible sets Kh are not necessarily nested and non-conforming in the sense that they are in general not contained in the feasible set K(X). In the following, c denotes a positive constant, which may take different values on different occasions.
Letbe a polyhedral domain andwithα(x)≥0 inΩ. Further let (wh) be a sequence that fulfils for allh, wh∈P1,h(Ω)dand |wh(xT)|≤α(xT) for all. Ifforh→0 inL2(Ω)d, then it holds that |w|≤αa.e. inΩ.Lemma 5.2
It suffices to show that iK(w)=0, where
Proof.
Letbe a polyhedral domain andwithα(x)≥0 inΩ. Let (wh) be a sequence that fulfils for allh, wh∈P1,h(Ω)dand |wh(x)|≤α(x) for all. Ifforh→0 inL2(Ω)dthen it holds that |w|≤αa.e. inΩ.Lemma 5.3
The assertion follows by a slight modification of the proof of lemma 5.2. Instead of the piecewise constant interpolant we define αh as the piecewise affine interpolant of α, i.e. αh=Ihα, which fulfils α(x)=(Ihα)(x) for all and αh→α strongly in . By (5.8), we obtain
Proof.
Let be a polyhedral domain and such that (3.1) holds true. Then the sets
Theorem 5.4
Since weak convergence in H1(Ω) implies weak convergence in L2(Ω), the preceding lemma 5.2 shows that (M1) is fulfilled. We now show (M2′). To prove the assertion, we may use a strategy that is similar to the one in [4], ch. II and requires (3.4). Note that theorem 3.1 implies that the set
Proof.
Under the conditions of theorem 5.4, the sequence (Kh) defined in (5.8) Mosco converges forh→0 to the setK(L2(Ω)d) inL2(Ω)d.Corollary 5.5
Again, lemma 5.2 implies that (M1) with X=L2(Ω)d holds true. For defined in (5.10) it holds that is also dense in K(L2(Ω)d) with respect to the L2(Ω)d-norm (cf. (3.2)). Thus, (M2′) follows analogously to the proof of theorem 5.4. ▪Proof.
Under the conditions of theorem 5.4, the node-based discrete setsCorollary 5.6
The proof is analogous to the proof of theorem 5.4, noting that (5.13) also implies rhw∈Kh∀h≤h0 with Kh according to the node-based definition (5.14). ▪Proof.
With the help of the density property (3.2) for uniformly continuous upper bounds, the above results on the Mosco convergence of discretized convex sets carry over to spaces involving homogeneous Dirichlet boundary conditions. In this context, the set P1,h(Ω) in the definitions of the discretized sets Kh in (5.9) and (5.14) has to be replaced by the space
Remark 5.7
With the help of the density result (3.2), one obtains the following result for the discrete approximation of pointwise constraint sets in H(div;Ω) by the Raviart–Thomas finite-element space RTh(Ω) (cf. (5.4)).
Let be a polyhedral domain. Let such that (3.1) is satisfied. Then the sets
Theorem 5.8
Let wh∈Kh for all h. First observe that if (wh) weakly converges to w in H(div;Ω), then it also weakly converges to w in L2(Ω)N. Analogously to the proof of lemma 5.2 one concludes that |w|≤α a.e. in Ω. The continuity of the normal trace mapping
Proof.
The previous approach can also be applied to derive approximation results for constraint sets involving pointwise bounds on partial derivatives. To begin with, we consider the gradient-constraint sets
Let be a polyhedral domain. Let such that (3.1) is satisfied. Define
Theorem 5.9
To prove (M1), it suffices to notice that if in H1(Ω)d then in L2(Ω)N×d. Similar to the proof of lemma 5.2, one obtains for v∈Cc(Ω)N×d that
Proof.
To prove (M2′), we consider again the global interpolation operator Ih from (5.3). The standard estimate
Next we consider pointwise constraints on the divergence. For X(Ω)⊂H(div;Ω) let
Let be a polyhedral domain. Let fulfil (3.1). Then the sets
Theorem 5.10
Taking account of the fact that in H(div;Ω), wh∈Kh, implies in L2(Ω), (M1) follows analogously to the corresponding part of the proof of corollary 5.9. Since is dense in Kdiv(H0(div;Ω)) [11, Theorem 4], the set
Proof.
For a general Lp-function as upper bound, a point-based discretization is obviously not possible. As a remedy, the construction of the discrete sets Kh typically involves some kind of averaging process. For this purpose, we define the integral mean
Now we have to take into account that the density results of the type (3.2) and (3.4), which represent the main ingredient to prove the consistency of the finite-element approximation, may fail to hold true (e.g. theorem 4.2). On the other hand, the results from §4 indicate that the density property is still guaranteed for a large class of discontinuous obstacles. To maintain the greatest level of generality, we assume that the non-negative measurable function allows for the density property
Letbe a polyhedral domain andα∈L2(Ω) withα(x)≥0 a.e. inΩ. Let (wh) be a sequence that fulfils for allh, wh∈P1,h(Ω)dand |wh(xT)|≤ for all. Ifforh→0 inL2(Ω)dthen it holds that |w|≤αa.e. inΩ.Lemma 5.11
The assertion follows analogously to the proof of lemma 5.2 by a slight modification of the definition of αh. Instead of the piecewise constant interpolant we consider the piecewise constant quasi-interpolant . Observe that αh converges strongly to α in L2(Ω)d, which is sufficient for the above argument. ▪Proof.
Let be a polyhedral domain. Let α∈L2(Ω) with (3.1) such that (5.17) holds true. Then the sets
Theorem 5.12
We only need to prove (M2′) since corollary 5.11 implies (M1). First note that (3.1) and (5.18) imply that the set
Proof.
6. Further applications
(a) Regularization of elasto-plastic contact problems
In the context of the one time-step problem of quasi-static elasto-plasticity with an associative flow law, the deformation of a material represented by a bounded Lipschitz domain Ω subject to given applied forces is modelled by the evolution of the displacement, the material stress and strain as well as certain internal variables (cf. [6]). An elasto-plastic contact problem arises if the movement of the material is additionally restricted by the presence of a rigid obstacle. From a mathematical point of view, the problem can be equivalently reformulated in terms of the normal stress z* at the (sufficiently smooth) contact boundary Γc⊂∂Ω, and a variable q that is related to the deviatoric part of the material stress; for details we refer to [24, p.154]:
The functionalis weakly l.s.c. and it fulfils (i) r(z*)=0 for allz*∈H1/2+(Γc)*, (ii) r(z*)>0 for allz*∈H1/2(Γc)*∖H1/2+(Γc)*, (iii) for allz∈L2(Γc).Lemma 6.1
As a composition of a convex, continuous and monotone function with a supremum of l.s.c. and convex functions, is weakly l.s.c. Assertions (i) and (ii) are direct consequences of the definition of . For z∈L2−(Γc)={z∈L2(Γc):z≤ 0 a.e. in Ω}, it holds r(z)=0 and (iii) is always satisfied. Now let z∈L2(Γc)∖L2−(Γc). By the density of H1/2+(Γc) in L2+(Γc) it holds that
Proof.
From the discussion in the introduction and theorem 2.1, it is known that the consistency of the regularization scheme (6.2) with respect to (6.1) hinges on the density of K(H1(Ω)d) in K(L2(Ω)d), where
(b) Fenchel duality in image restoration
Optimization problems with total variation regularization have been successfully considered in the image restoration context. In the denoizing setting, an original image utrue that belongs to the space of functions of bounded variation BV(Ω), , is sought to be recovered from a noise perturbed measurement f=utrue+η with η∈L2(Ω), and . This motivates the optimization problem
The drawback of the above reconstruction scheme is that the choice of the regularization parameter α is global: A good reconstruction locally requires high values of α in some regions of Ω (e.g. flat regions of utrue) and low values in other regions (e.g. locations of details of utrue). A recent approach in [32,33] proposes the following alternative: For a function such that (3.1) holds true, consider the optimization problem
As usual in convex optimization, it is convenient to consider the problem in (6.3) from the point of view of Fenchel duality. In fact, (6.3) can be characterized as the Fenchel dual problem of the following constrained optimization problem:
7. Conclusion
We investigate the stability of a large number of perturbation and dualization approaches to variational inequality and constrained optimization problems in the context of density properties of a convex constraint set. If the intersection with certain dense subspaces is dense in the feasible set, one may prove the unconditional consistency of various perturbation schemes including Galerkin approximations. In this regard, the class of quasi-monotone perturbations provides a unified framework.
The abstract motivation leads to the study of density properties of constraint sets in Sobolev spaces with respect to spaces of smooth functions. We focus specifically on sets that are defined by a pointwise constraint on the norm of the function value. In this case, the density property is determined by the regularity of the upper bound. Whereas the case of a uniformly continuous obstacle gives rise to positive density results in various Sobolev spaces, the result fails to be valid in general, if the obstacle is just a Sobolev function. However, a large variety of discontinuous upper bounds still remains compatible with the density property. This includes functions that fulfil a generalized lower semicontinuity condition as well as supersolutions of elliptic PDEs.
Density results further allow to deduce the Mosco convergence of various finite-element discretized constraint sets in Sobolev spaces. Finally, the previous results are applied in the context of the regularization of quasi-static elasto-plastic contact problems and the dualization of total variation-based image restoration problems.
Our future research is concerned with the refined characterization of the class of upper bounds that comply with the density property. Another interesting direction of future research, which we plan to pursue, is related to constraint qualifications (CQs) in the context of Fenchel–Legendre dualization in convex and possibly non-smooth optimization. Here it appears that the density of convex intersections may provide a suitable constraint qualification implying duality without a duality gap. Such a density CQ appears to neither imply nor be contained in currently known constraint qualifications like those used in the work by Hedy Attouch and co-authors (e.g. [34]). Another current research aspect concerns the ramification of remark 3.2(ii). In the presence of an inhomogeneous Dirichlet boundary condition, the construction of suitable trace-preserving mollification operators with variable support appears promising. Those operators are also of utmost interest in the context of non-smooth variational problems in image restoration.
Data accessibility
This paper has no additional data.
Authors' contributions
All authors contributed equally to this work and gave final approval for publication.
Competing interests
We declare we have no competing interests.
Funding
This research was carried out in the framework of Matheon supported by the Einstein Foundation Berlin within the ECMath projects OT1, SE5 and SE15 as well as project HI1466/7-1 ‘Free Boundary Problems and Level Set Methods’ funded by the DFG. The authors further gratefully acknowledge the support of the DFG through the DFG-SPP 1962: Priority Programme ‘Non-smooth and Complementarity-based Distributed Parameter Systems: Simulation and Hierarchical Optimization’ within projects 10, 11 and 13. The publication of this article was funded by the Open Access fund of the Weierstrass Institute.
Acknowledgements
We thank two anonymous reviewers for their helpful comments.
Appendix A. Properties of quasi-monotone perturbations
Denote by
Proof of theorem 2.1
Let and ρ>0 such that , where Bρ(x):={y∈X:∥x−y∥<ρ}. (a) We first prove the following result:
Proof of proposition 2.6
(b) Non-existence of a strong recovery sequence:
Choose (γn) according to (7.2) and assume that there exists a recovery sequence (yn) to x, which means that yn→x and F(yn)+(γn/2)dist(yn,K)2+iXn(yn)→F(x). The continuity of F implies that yn∈Xn for sufficiently large n and that (γn/2)dist(yn,K)2→0. Consequently, using yn→x and x∈K, there exists such that
Footnotes
References
- 1
Ekeland I, Temam R . 1987Convex analysis and variational problems. Classics in applied mathematics, vol. 28. Philadelphia, PA: Society for Industrial and Applied Mathematics. Google Scholar - 2
Attouch H, Buttazzo G, Michaille G . 2014Variational analysis in Sobolev and BV spaces: applications to PDEs and optimization, 2nd edn. Philadelphia, PA: SIAM. Crossref, Google Scholar - 3
Clarke FH . 1990Optimization and nonsmooth analysis, 2nd edn. Philadelphia, PA: Society for Industrial and Applied Mathematics. Crossref, Google Scholar - 4
Glowinski R . 1984Numerical methods for nonlinear variational problems. Berlin, Germany: Springer. Crossref, Google Scholar - 5
Lions J-L, Glowinski R, Trémolières R . 1981Numerical analysis of variational inequalities. Amsterdam, The Netherlands: North-Holland. Google Scholar - 6
Han W, Reddy BD . 2013Plasticity: mathematical theory and numerical analysis, 2nd edn. New York, NY: Springer. Crossref, Google Scholar - 7
Rodrigues JF . 1987Obstacle problems in mathematical physics. Amsterdam, The Netherlands: North-Holland. Google Scholar - 8
Rodrigues JF . 2004On hyperbolic variational inequalities of first order and some applications. Monatshefte für Mathematik 142, 157–177. (doi:10.1007/s00605-004-0238-3) Crossref, ISI, Google Scholar - 9
Dal Maso G, DeSimone A, Mora MG . 2006Quasistatic evolution problems for linearly elastic-perfectly plastic materials. Arch. Ration. Mech. Anal. 180, 237–291. (doi:10.1007/s00205-005-0407-0) Crossref, ISI, Google Scholar - 10
Bartels S, Mielke A, Roubíček T . 2012Quasi-static small-strain plasticity in the limit of vanishing hardening and its numerical approximation. SIAM J. Numer. Anal. 50, 951–976. (doi:10.1137/100819205) Crossref, ISI, Google Scholar - 11
Hintermüller M, Rautenberg CN . 2015On the density of classes of closed convex sets with pointwise constraints in Sobolev spaces. J. Math. Anal. Appl. 426, 585–593. (doi:10.1016/j.jmaa.2015.01.060) Crossref, ISI, Google Scholar - 12
- 13
Mielke A, Roubíček T . 2015Rate-independent Systems. Berlin, Germany: Springer. Crossref, Google Scholar - 14
Kinderlehrer D, Stampacchia G . 1980An introduction to variational inequalities and their applications. New York, NY: Academic Press. Google Scholar - 15
Mosco U . 1969Convergence of convex sets and of solutions of variational inequalities. Adv. Math. (N.Y) 3, 510–585. (doi:10.1016/0001-8708(69)90009-7) Crossref, ISI, Google Scholar - 16
- 17
Adams RA, Fournier JJF . 2003Sobolev spaces, 2nd edn.Pure and Applied Mathematics Series, vol. 140 . Amsterdam, The Netherlands: Elsevier Science. Google Scholar - 18
Evans LC . 1998Partial differential equations. Providence, RI: American Mathematical Society. Google Scholar - 19
Hintermüller M, Rautenberg CN, Rösel S . 2016Density of convex intersections and applications. Berlin, Germany: WIAS. WIAS Preprint No. 2333. Google Scholar - 20
Toyoizumi H . 1991Continuous dependence on obstacles in variational inequalities. Funkcialaj Ekvacioj 34, 103–115. Google Scholar - 21
Nečas J . 1967Les méthodes directes en théorie des équations elliptiques. Prague, Czechoslovakia: Academia. Google Scholar - 22
Grisvard P . 1985Elliptic problems in nonsmooth domains. London, UK: Pitman Publishing. Google Scholar - 23
Trudinger NS . 1971On the regularity of generalized solutions of linear, non-uniformly elliptic equations. Arch. Ration. Mech. Anal. 42, 50–62. (doi:10.1007/BF00282317) Crossref, ISI, Google Scholar - 24
Hintermüller M, Rösel S . 2016A duality-based path-following semismooth Newton method for elasto-plastic contact problems. J. Comput. Appl. Math. 292, 150–173. (doi:10.1016/j.cam.2015.06.010) Crossref, ISI, Google Scholar - 25
Hintermüller M, Kunisch K . 2004Total bounded variation regularization as bilaterally constrained optimization problem. SIAM J. Appl. Math. 64, 1311–1333. (doi:10.1137/S0036139903422784) Crossref, ISI, Google Scholar - 26
Siebert KG, Veeser A . 2007A unilaterally constrained quadratic minimization with adaptive finite elements. SIAM. J. Optim. 18, 260–289. (doi:10.1137/05064597X) Crossref, ISI, Google Scholar - 27
Siebert KG . 2011A convergence proof for adaptive finite elements without lower bound. IMA J. Num. Anal. 31, 947–970. (doi:10.1093/imanum/drq001) Crossref, ISI, Google Scholar - 28
Ern A, Guermond JL . 2004Theory and practice of finite elements. Berlin, Germany: Springer. Crossref, Google Scholar - 29
Bahriawati C, Carstensen C . 2005Three MATLAB implementations of the lowest-order Raviart-Thomas MFEM with a posteriori error control. Comput. Methods Appl. Math. 5, 333–361. (doi:10.2478/cmam-2005-0016) Crossref, Google Scholar - 30
Brezzi F, Hager WW, Raviart PA . 1977Error estimates for the finite element solution of variational inequalities. Part I. Primal theory. Numerische Mathematik 28, 431–444. (doi:10.1007/BF01404345) Crossref, ISI, Google Scholar - 31
Rudin LI, Osher S, Fatemi E . 1992Nonlinear total variation based noise removal algorithms. Phys. D 60, 259–268. (doi:10.1016/0167-2789(92)90242-F) Crossref, ISI, Google Scholar - 32
Hintermüller M, Rautenberg CN . 2017Optimal selection of the regularization function in a generalized total variation model. Part I: Modelling and theory. J. Math. Imaging Vis. (doi:10.1007/s10851-017-0744-2) PubMed, ISI, Google Scholar - 33
Hintermüller M, Rautenberg CN, Wu T, Langer A . 2017Optimal selection of the regularization function in a generalized total variation model. Part II: Algorithm its analysis and numerical tests. J. Math. Imaging Vis. (doi:10.1007/s10851-017-0736-2) PubMed, ISI, Google Scholar - 34
Attouch H, Brezis H . 1986Duality for the sum of convex functions in general Banach spaces. In Aspects of mathematics and its applications. North-Holland Mathematical Library, vol. 34, pp. 125–133. Amsterdam, The Netherlands: North-Holland. Google Scholar


