Georg Stadler
email: ge.stadler@uni-graz.at

SEMISMOOTH NEWTON AND AUGMENTED LAGRANGIAN METHODS FOR A SIMPLIFIED FRICTION PROBLEM

Keywords: friction problem, semismooth Newton method, augmented Lagrangians, primaldual active set algorithm

In this paper a simplified friction problem and iterative second-order algorithms for its solution are analyzed in infinite dimensional function spaces. Motivated from the dual formulation, a primal-dual active set strategy and a semismooth Newton method for a regularized problem as well as an augmented Lagrangian method for the original problem are presented and their close relation is analyzed. Local as well as global convergence results are given. By means of numerical tests, we discuss among others convergence properties, the dependence on the mesh, and the role of the regularization and illustrate the efficiency of the proposed methodologies.

1. Introduction. This paper is devoted to the convergence analysis of iterative algorithms for the solution of mechanical problems involving friction. As a model problem we consider a simplified friction problem that can be stated as the minimization of the nondifferentiable functional J(y) := 1 2 a(y, y) -(f, y) L 2 (Ω) + g Γ f |τ y(x)| dx over the set Y := {y ∈ H 1 (Ω) : τ y = 0 a.e. on Γ 0 }, (P)

where Ω ⊂ R n is an open bounded domain with Lipschitz continuous boundary Γ, Γ 0 ⊂ Γ is a possibly empty open set, Γ f := Γ \ Γ 0 , further g > 0, f ∈ L 2 (Ω), τ denotes the trace operator, and a(• , •) denotes a coercive bilinear form on Y × Y . Introducing for y ∈ H 1 (Ω) the abbreviation j(y) := g

Γ f |τ y(x)| dx,
it is well known (cf. [START_REF] Glowinski | Numerical Methods for Nonlinear Variational Problems[END_REF]) that (P) can be written as the elliptic variational inequality of the second kind Find y ∈ Y such that a(y, zy) + j(z)j(y) ≥ (f, zy) L 2 (Ω) for all z ∈ Y .

(1.1) While usually in engineering papers finite dimensional discretizations of (P) or (1.1) and related problems are studied, little attention has been paid to their infinite dimensional counterparts, specifically to Newton-type methods. This contribution focuses on the formulation and analysis of second-order solution algorithms for (P) in a function space framework. Such an infinite dimensional analysis gives more insight into the problem, which is also of significant practical importance since the performance of a numerical algorithm is closely related to the infinite dimensional problem structure. In particular, it is desirable that the numerical method can be considered as the discrete version of a well-defined and well-behaved algorithm for the continuous problem. A finite dimensional approach misses important features as, for example, the regularity of Lagrange multipliers and its consequences as well as smoothing and uniform definiteness properties of the involved operators. It is well accepted that these properties significantly influence the behavior of numerical algorithms.

In principal there are two approaches to overcome the difficulty associated with the nondifferentiability in (P). One is based on resolving the derivative of the absolute value function introducing a Lagrange multiplier; the other one is based on an appropriate smoothing of the nondifferentiable term j(•).

An overrelaxation method and the Uzawa algorithm are proposed in the monographs [START_REF] Glowinski | Numerical Methods for Nonlinear Variational Problems[END_REF][START_REF] Glowinski | Numerical Analysis of Variational Inequalities[END_REF] for the solution of (P), and convergence results for these first-order methods are given. The Uzawa method is also suggested for a variational inequality of the second kind in [START_REF] Han | On the numerical approximation of a frictional contact problem with normal compliance[END_REF]; however, in that paper no numerical results are given. In [START_REF] Hlaváček | Solution of Variational Inequalities in Mechanics[END_REF] iterative techniques for the solution of friction contact problems are presented and further developed in [START_REF] Haslinger | On a splitting type algorithm for the numerical realization of contact problems with Coulomb friction[END_REF]. Those methods require minimization of a nondifferentiable functional over a convex set in every iteration step, which also motivates our investigation of problem (P).

In [START_REF] Christensen | A nonsmooth Newton method for elastoplastic problems[END_REF][START_REF] Christensen | Formulation and comparison of algorithms for frictional contact problems[END_REF][START_REF] Christensen | Reformulation: Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods[END_REF] a generalized differentiability concept (Pang's B-differential) is used that allows application of a Newton-like method for discretizations of friction contact problems, whereas algorithm formulation and analysis are done in finite dimensional spaces and only few convergence rate results are given. The authors of those contributions report on good numerical results and, in [START_REF] Christensen | Reformulation: Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods[END_REF], an almost mesh independent behavior of the algorithm is observed, which suggests that the finite dimensional method is induced by an infinite dimensional one. A different approach towards numerical realization of discrete elliptic variational inequalities of the second kind was followed in [START_REF] Kornhuber | Monotone multigrid methods for elliptic variational inequalities[END_REF][START_REF] Kornhuber | Adaptive Monotone Multigrid Methods for Nonlinear Variational Problems[END_REF], where monotone multigrid methods are employed to derive an efficient solution method.

For a smoothed variational inequality of the second kind, again in [START_REF] Glowinski | Numerical Analysis of Variational Inequalities[END_REF] the Uzawa method is proposed. More recent contributions apply classical Newton methods to the smoothed finite dimensional problems (see, e.g., [START_REF] Leung | Smoothing Newton method for solving two-and three-dimensional frictional contact problems[END_REF]).

While there is a large literature on finite dimensional constrained and nondifferential optimization techniques (see, e.g., [START_REF] Facchinei | Finite-Dimensional Variational Inequalities and Complementarity Problems[END_REF][START_REF] Qi | Convergence analysis of some algorithms for solving nonsmooth equations[END_REF][START_REF] Qi | A nonsmooth version of Newton's method[END_REF] for finite dimensional semismooth Newton methods), the systematic analysis of these methods in continuous function spaces started only rather recently [START_REF] Hintermüller | The primal-dual active set strategy as a semismooth Newton method[END_REF][START_REF] Ulbrich | Semismooth Newton methods for operator equations in function spaces[END_REF]. The methods proposed in this paper are related to the primal-dual active set strategy for the solution of constrained optimal control problems [START_REF] Bergounioux | A comparison of a Moreau-Yosida-based active set strategy and interior point methods for constrained optimal control problems[END_REF][START_REF] Bergounioux | Primal-dual strategy for constrained optimal control problems[END_REF]. This algorithm is closely related to semismooth Newton methods as shown in [START_REF] Hintermüller | The primal-dual active set strategy as a semismooth Newton method[END_REF]. The papers [START_REF] Bergounioux | A comparison of a Moreau-Yosida-based active set strategy and interior point methods for constrained optimal control problems[END_REF][START_REF] Bergounioux | Primal-dual strategy for constrained optimal control problems[END_REF][START_REF] Hintermüller | The primal-dual active set strategy as a semismooth Newton method[END_REF][START_REF] Ito | Semi-smooth Newton methods for variational inequalities of the first kind[END_REF] apply these methodologies to unilateral pointwise constrained optimization problems; the convergence analysis for bilaterally constrained problems (as is the dual of (P)) involves additional problems as will come out in this contribution (see also [START_REF] Hintermüller | A primal-dual active set algorithm for bilaterally control constrained optimal control problems[END_REF][START_REF] Hintermüller | A semi-smooth Newton method for constrained linearquadratic control problems[END_REF]). The first-order augmented Lagrangian method for nonsmooth optimization is investigated within a Hilbert space framework in [START_REF] Ito | Augmented Lagrangian methods for nonsmooth, convex optimization in Hilbert spaces[END_REF].

This paper is organized as follows: In section 2 the dual problem for (P) and the extremality conditions are determined, and further possible generalizations of the model problem to vector-valued friction problems in linear elasticity are discussed. Section 3 is devoted to a regularization procedure for the dual formulation, the corresponding primal problem, and the convergence of the regularized problems. In section 4 we state algorithms for the solution of the regularized and the original friction problem and investigate their relation. Section 5 analyzes these algorithms and gives local as well as global convergence results. Finally, section 6 summarizes our numerical testing.

The dual problem.

In this section we summarize basic results for (P); further we calculate the dual problem and corresponding extremality conditions and discuss the relation between friction problems in elasticity and the model problem (P).

To simplify notation we use the trace operator τ f : Y -→ L 2 (Γ f ) defined by τ f y = (τ y) |Γ f . Before we calculate the dual problem, we state the following existence and uniqueness result.

Theorem 2.1. Problem (P) or equivalently (1.1) admits a unique solution ȳ ∈ Y . Note that in [START_REF] Duvaut | Inequalities in Mechanics and Physics[END_REF] conditions are stated that guarantee existence and uniqueness of a solution to (P) in the case that a(• , •) is not coercive. To get a deeper insight into problem (P) we next calculate the corresponding dual problem. We start with rewriting problem (P) as

inf y∈Y {F (y) + G(τ f y)} (2.1)
with the convex functionals

F (y) = 1 2 a(y, y) -(f, y) L 2 (Ω) and G(τ f y) = g Γ f |τ f y(x)| dx.
Following [START_REF] Ekeland | Convex Analysis and Variational Problems[END_REF], the dual problem can be written as sup

λ∈L 2 (Γ f ) {-F * (-τ f * λ) -G * (λ)} , (2.2)
where F * : Y * -→ R and G * : L 2 (Γ f ) -→ R denote the convex conjugate functionals to F and G, and

τ f * ∈ L(L 2 (Γ f ), Y *
) is the adjoint of τ f . In (2.2) we already identified L 2 (Γ f ) with its dual. Calculating (2.2) explicitly results in the following dual problem.

sup |λ|≤g a.e. on Γ f J * (λ) := - 1 2 a(w(λ), w(λ)), (P * )
where w(λ) denotes the unique solution of

a(w, v) -(f, v) L 2 (Ω) + (λ, τ f v) L 2 (Γ f ) = 0 for all v ∈ Y (2.3) for given λ ∈ L 2 (Γ f ).
From the convexity of F and G, further from the fact that there exists a y 0 ∈ Y such that F (y 0 ) < ∞, G(τ f y 0 ) < ∞, and from the continuity of G at

τ f y 0 , it follows that inf y∈Y J(y) = - sup |λ|≤g a.e. on Γ f J * (λ);
that is, no duality gap occurs (see [START_REF] Ekeland | Convex Analysis and Variational Problems[END_REF]). Existence of a solution λ ∈ L 2 (Γ f ) for the dual problem (P * ) follows from Fenchel's duality theorem. Thus, by means of duality theory we have transformed (P), the unconstrained minimization of a nondifferentiable functional, into (P * ), the constrained maximization of a smooth functional. Following duality theory the solutions ȳ, λ of the primal problem (P) and the dual problem (P * ), respectively, are connected by the extremality conditions

-τ f * λ ∈ ∂F (ȳ), λ ∈ ∂G(τ f ȳ),
with ∂ denoting the subdifferential. These conditions, which also characterize primal and dual solution (cf. [START_REF] Ekeland | Convex Analysis and Variational Problems[END_REF]), result in (2.5)

a(ȳ, v) -(f, v) L 2 (Ω) + ( λ, τ f v) L 2 (Γ f ) = 0 for all v ∈ Y (2.
The next lemma states an equivalent expression for condition (2.5), which will be used frequently. The equivalence follows from results in convex analysis but can also easily be verified by a direct computation. Lemma 2.2. Condition (2.5) can equivalently be expressed as

τ f ȳ = max(0, τ f ȳ + σ( λ -g)) + min(0, τ f ȳ + σ( λ + g)) (2.6)
for every σ > 0.

Concerning a numerical solution of (P) in [START_REF] Glowinski | Numerical Analysis of Variational Inequalities[END_REF], two methods are proposed. First, an overrelaxation method for the discretized problem is described and tested; second, Uzawa's algorithm is applied to (P) and convergence results are given. Since we focus on higher-order methods, and further since for (P * ) the iterates of the algorithms presented in section 4 are not contained in spaces of square integrable functions, we introduce a regularization procedure for (P * ) that allows the statement and analysis of our algorithms in infinite dimensional Hilbert spaces and will be shown to be closely related to augmented Lagrangians.

We conclude this section with a brief discussion of possible generalizations of our model problem (P) to vector-valued friction problems in linear elasticity (see [START_REF] Duvaut | Inequalities in Mechanics and Physics[END_REF][START_REF] Kikuchi | Contact Problems in Elasticity: A Study of Variational Inequalities and Finite Element Methods[END_REF]). Let Ω ⊂ R n be occupied by the elastic body in its nondeformed state and denote by y ∈ Y := Y n the deformation of the body that is fixed on Γ 0 , subject to a given force on Ω and to friction conditions on Γ f . For the material law we take, e.g., the Navier-Lamé equations and denote the corresponding bilinear form on Y × Y by a(• , •). Then, similarly as for (P), we get the following condition for y:

a(y, v) -(f , v) L 2 (Ω) + (λ, v T ) L 2 (Γ f ) = 0 for all v ∈ Y , (2.7) where L 2 (Ω) := (L 2 (Ω)) n , L 2 (Γ f ) = (L 2 (Γ f )) n , f ∈ L 2 (Ω)
is a given force, (•) T denotes the tangential part along Γ f , and λ ∈ L 2 (Γ f ). Let us assume that the region of contact between the body and the rigid foundation is fixed (bilateral contact), i.e., the normal component y N of y along Γ f is zero, and let us take Tresca's law to model friction on Γ f . This leads to the conditions y N = 0 and ||λ|| ≤ g on Γ f (here || • || denotes the Euclidean norm in R n ) and to y T = 0 a.e. on I := {x ∈ Γ f : ||λ|| < g a.e. on Γ f }, y T = 1 g ||y T ||λ a.e. on A := {x ∈ Γ f : ||λ|| = g a.e. on Γ f }.

(2.8)

The above complementarity system models the assumption that slip begins if a certain magnitude of friction traction is exceeded. Note the similarity between (2.4), (2.5) and (2.7), (2.8). In case of planar elasticity (i.e., n = 2), one has that y T = yt, where t is the unit tangential vector along Γ f and y is a scalar-valued function. This allows us to replace (2.8) by (2.5); i.e., this paper covers friction in planar elasticity. For n ≥ 3, however, compared to (2.5) the expression in (2.8) includes an inherent nonlinearity on A. We plan to extend the results presented in this paper for the simplified model problem (P) to elasticity problems with friction for n ≥ 3 in our future research.

3. Regularization. In this section we introduce a regularization procedure to overcome the difficulty associated with the nondifferentiability of the functional J in (P). Therefore we consequently utilize results from duality theory and discuss relations between the regularization and the primal and dual problem.

For the term Γ f |τ y(x)| dx in (P), which involves the absolute value function, many ways to construct sequences of differentiable approximations are possible (cf., e.g., [START_REF] Han | A regularization procedure for a simplified friction problem[END_REF][START_REF] Huang | The regularization method for an obstacle problem[END_REF]). While these regularizations are mainly motivated by the primal problem, our approximation is motivated by considering the dual problem and by results in the context of semismooth Newton methods [START_REF] Hintermüller | The primal-dual active set strategy as a semismooth Newton method[END_REF][START_REF] Ito | Semi-smooth Newton methods for variational inequalities of the first kind[END_REF][START_REF] Ulbrich | Semismooth Newton methods for operator equations in function spaces[END_REF] and augmented Lagrangians [START_REF] Ito | Augmented Lagrangian methods for nonsmooth, convex optimization in Hilbert spaces[END_REF]. In the corresponding primal problem the regularization turns out to be a very natural one that is related to those used in [START_REF] Glowinski | Numerical Analysis of Variational Inequalities[END_REF][START_REF] Han | On the numerical approximation of a frictional contact problem with normal compliance[END_REF][START_REF] Lee | A priori error estimation of hp-finite element approximations of frictional contact problems with normal compliance[END_REF].

This section is organized as follows. After presenting the regularization for the dual problem, we calculate the corresponding primal problem and the optimality system, argue the connection with [START_REF] Glowinski | Numerical Analysis of Variational Inequalities[END_REF][START_REF] Han | On the numerical approximation of a frictional contact problem with normal compliance[END_REF][START_REF] Ito | Semi-smooth Newton methods for variational inequalities of the first kind[END_REF][START_REF] Lee | A priori error estimation of hp-finite element approximations of frictional contact problems with normal compliance[END_REF], and investigate the convergence as the regularization parameter tends to infinity.

3.1. Regularization for (P * ). For fixed γ > 0 and λ ∈ L 2 (Γ f ), we consider

sup |λ|≤g a.e. on Γ f J * γ (λ) := - 1 2 a(w(λ), w(λ)) - 1 2γ λ -λ 2 L 2 (Γ f ) + 1 2γ λ 2 L 2 (Γ f ) , (P * γ )
where again w(λ) denotes the solution to (2.3) for given λ. This regularized problem, which has the form of the auxiliary problem in proximal point methods, is obtained from (P * ) by adding

- 1 2γ λ -λ 2 L 2 (Γ f ) + 1 2γ λ 2 L 2 (Γ f ) (3.1)
to the objective functional. Standard arguments show that (P * γ ) admits a unique solution λ γ for every γ > 0. The second term in (3.1), which is a constant, can be neglected from the optimizational point of view; it has been introduced to get a simple connection with the corresponding primal problem (see Theorem 3.2).

In what follows we shall use e :

Y × L 2 (Γ f ) -→ Y * defined by e(y, λ), z Y * ,Y = a(y, z) -(f, z) L 2 (Ω) + (λ, τ f z) L 2 (Γ f ) .
This allows us to write (2.3) as e(y, λ) = 0 in Y * . We now derive the first-order optimality conditions for the constrained optimization problem (P * γ ) using Lagrange multipliers.

Theorem 3.1. Let λ γ ∈ L 2 (Γ f ) be the unique solution of (P * γ ). Then there exist

y γ ∈ Y and ξ γ ∈ L 2 (Γ f ) such that e(y γ , λ γ ) = 0 in Y * , (3.2a) τ f y γ + γ -1 ( λ -λ γ ) -ξ γ = 0 in L 2 (Γ f ), (3.2b) ξ γ -max(0, ξ γ + σ(λ γ -g)) -min(0, ξ γ + σ(λ γ + g)) = 0 in L 2 (Γ f ) (3.2c)
hold for every σ > 0.

Note that (3.2c) is equivalent to ⎧ ⎨ ⎩ ξ γ ≤ 0 a.e. on A γ, -:= {x ∈ Γ f : λ γ = -g a.e. on Γ f }, ξ γ = 0 a.e. on I γ := {x ∈ Γ f : |λ γ | < g a.e. on Γ f }, ξ γ ≥ 0 a.e. on A γ,+ := {x ∈ Γ f : λ γ = g a.e. on Γ f }.

(3.3) 3.2. Corresponding primal problem. Next we turn our attention to the primal formulation of problem (P * γ ). For α ∈ R we define

h(x, α) = g γ |γx + α| -g 2 2γ if |γx + α| > g, 1 2γ (γx + α) 2 if |γx + α| ≤ g.
The function h is a continuously differentiable smoothing of the absolute value function. We can now define problem (P γ ):

min y∈Y J γ (y) := 1 2 a(y, y) -(f, y) L 2 (Ω) + Γ f h(τ f y(x), λ(x)) dx. (P γ )
Note that the functional J γ is uniformly convex and continuously differentiable. The next theorem clarifies the connection between (P γ ) and (P * γ ). The proof uses standard arguments from duality theory.

Theorem 3.2. Problem (P * γ ) is the dual problem of (P γ ) and we have J * γ (λ γ ) = -J γ (y γ ), where λ γ and y γ denote the solutions of (P * γ ) and (P γ ), respectively. Furthermore, if one introduces the variable

ξ γ := τ f y γ + γ -1 ( λ -λ γ ) ∈ L 2 (Γ f ), the extremality conditions yield (3.2a)-(3.2c
) and these conditions are sufficient for λ γ and y γ to be the solution of (P * γ ) and (P γ ), respectively. We next discuss by what means the above regularization is related to those used in other papers. First consider the case that λ ≡ 0. Then the smoothing of the absolute value function in (P γ ) results in

h(x) = g|x| -g 2 2γ if |x| ≥ g γ , γ 2 x 2 if |x| < g γ .
This approximation of the absolute value function has also been studied and used in [START_REF] Glowinski | Numerical Analysis of Variational Inequalities[END_REF][START_REF] Han | On the numerical approximation of a frictional contact problem with normal compliance[END_REF][START_REF] Lee | A priori error estimation of hp-finite element approximations of frictional contact problems with normal compliance[END_REF] for the numerical solution of related problems. Let us now argue the relation of the above regularization to the one in [START_REF] Ito | Semi-smooth Newton methods for variational inequalities of the first kind[END_REF], where λ is now arbitrary.

For this purpose we choose σ := γ -1 in the complementarity condition (3.2c) and eliminate the variable ξ γ using (3.2b). This gives

τ f y γ + γ -1 ( λ -λ γ ) -max(0, τ f y γ + γ -1 ( λ -g)) -min(0, τ f y γ + γ -1 ( λ + g)) = 0. (3.4)
One can see that the specific choice of σ := γ -1 results in eliminating the variable λ γ in the max-and min-function, which is of interest regarding semismooth Newton methods, as will become clear in the next section. In [START_REF] Ito | Semi-smooth Newton methods for variational inequalities of the first kind[END_REF] a formulation related to (3.4) was successfully used to construct an effective algorithm for unilaterally constrained variational problems of the first kind. However, in the case of (P * γ ), which is a bilaterally constrained optimization problem, (3.4) may mislead us to an algorithm, which is less efficient. Obviously, from the theoretical point of view, the two formulations are equivalent, but the splitting of (3.4) into (3.2b) and (3.2c) contains the additional parameter σ and thus motivates a slightly different algorithm, as will be discussed in section 4. Next we investigate the convergence as γ → ∞.

3.3. Convergence of the regularized problems. We conclude this section with a convergence result with respect to the regularization parameter γ (for related results see [START_REF] Glowinski | Numerical Analysis of Variational Inequalities[END_REF][START_REF] Ito | Semi-smooth Newton methods for variational inequalities of the first kind[END_REF]).

Theorem 3.3. For any λ ∈ L 2 (Γ f ) the solutions y γ of the regularized problems (P γ ) converge to the solution ȳ of the original problem (P) strongly in Y as γ → ∞. Furthermore, the solutions λ γ of the dual problems (P * γ ) converge to the solution λ of (P * ) weakly in L 2 (Γ f ).

Proof. Recall the complementarity conditions and the definition of the active and inactive sets (2.5) for the original and (3.3) for the regularized problem. Note that for all γ > 0 we have |λ γ | ≤ g a.e. on Γ f . We now choose an arbitrary sequence γ n such that γ n → ∞ for n → ∞. From the weak compactness of the unit sphere in a Hilbert space, we can infer the existence of

λ * ∈ L 2 (Γ f ) and a subsequence λ γ n k in L 2 (Γ f ) such that λ γ n k λ * weakly in L 2 (Γ f ).
Since closed convex sets in Hilbert spaces are weakly closed, we have

|λ * | ≤ g a.e. in L 2 (Γ f ). The weak convergence of (λ γ n k ) in L 2 (Γ f ) implies y γ n k y *
weakly in Y for some y * ∈ Y and that the pair (y * , λ * ) also satisfies e(y * , λ * ) = 0. We henceforth drop the subscript n k with γ n k . It follows that

a(y γ -ȳ, y γ -ȳ) = (τ f ȳ, λ γ -λ) L 2 (Γ f ) + (τ f y γ , λ -λ γ ) L 2 (Γ f ) . (3.5)
We are now going to estimate the above two terms separately. Let us first turn our attention to the term (τ f ȳ, λ γ -λ) L 2 (Γ f ) . We have that

τ f ȳ(λ γ -λ) = τ f ȳ(λ γ -g) ≤ 0 a.e. on A + ,
since τ f ȳ ≥ 0 and λ γ ≤ g. Similarly we find that τ f ȳ(λ γ -λ) ≤ 0 on A -utilizing τ f ȳ ≤ 0 and λ γ ≥ -g. Finally, on I we have τ f ȳ = 0 which yields, since

Γ f = A -∪ A + ∪ I, that (τ f ȳ, λ γ -λ) L 2 (Γ f ) ≤ 0. (3.6)
Next we consider τ f y γ ( λλ γ ) on the sets A γ,-, A γ,+ , and I γ , which also form a disjoint splitting of Γ f . On A γ,-the variable λ γ is equal to -g and γτ f y γ + λ ≤ -g holds. This implies

τ f y γ ( λ -λ γ ) = τ f y γ ( λ + g) ≤ γ -1 (-g -λ)( λ + g) a.e. on A γ,-. (3.7)
By a similar calculation one finds

τ f y γ ( λ -λ γ ) ≤ γ -1 (g -λ)( λ -g) a.e. on A γ,+ . (3.8)
On I γ we have λ γ = γτ f y γ + λ and thus |γτ f y γ + λ| < g, which shows that a.e.

τ f y γ ( λ -λ γ ) = τ f y γ ( λ -γτ f y γ -λ) = -γ|τ f y γ | 2 + τ f y γ ( λ -λ) ≤ -γ|τ f y γ | 2 + |τ f y γ || λ -λ| ≤-γ|τ f y γ | 2 + γ -1 (g + | λ|)| λ -λ|. (3.9)
Hence, using (3.7), (3.8), and (3.9), one gets

(τ f y γ , λ -λ γ ) L 2 (Γ f ) ≤ γ -1 (g + | λ|, | λ| + | λ| + g) L 2 (Γ f ) . (3.10)
Using (3.5), (3.6), (3.10), and the coercivity (with constant ν > 0) of a(• , •) on Y , we can estimate

0 ≤ lim sup γ→∞ ν y γ -ȳ 2 H 1 (Ω) ≤ lim sup γ→∞ a(y γ -ȳ, y γ -ȳ) ≤ lim γ→∞ (τ f y γ , λ -λ γ ) L 2 (Γ f ) ≤ lim γ→∞ γ -1 (g + | λ|, | λ| + | λ| + g) L 2 (Γ f ) = 0. (3.11)
It follows that y γ → ȳ strongly in Y and hence y * = ȳ. Passing to the limit in e(y γ , λ γ ) = 0 and using that weak limits are unique imply λ * = λ. Thus we have proved that every sequence

γ n with γ n → ∞ for n → ∞ contains a subsequence γ n k such that λ γ n k λ in L 2 (Γ f ) and y γ n k → ȳ in Y . Since (ȳ, λ
) is the unique solution to (3.2a)-(3.2c), the whole family {(y γ , λ γ )} converges in the sense given in the statement of the theorem.

As a corollary to the proof of Theorem 3.3 one obtains a convergence rate of y γ to ȳ.

Corollary 3.4. Let y γ and ȳ be solutions of (P γ ) and (P), respectively. Then there exists a C > 0 independent of γ such that

y γ -ȳ H 1 (Ω) ≤ C √ γ . (3.12)
Proof. The inequality follows from (3.11) and the coercivity of a(• , •) on Y .

4. Algorithms for the solution of (P * γ ) and (P * ). In this section we present iterative algorithms to solve (P * γ ) and (P * ). To simplify notation we drop the subscript γ for the iterates (y k γ , λ k γ , ξ k γ ) of the algorithms. The solution variables of the regularized problem are still denoted by (y γ , λ γ , ξ γ ).

4.1. Primal-dual active set algorithm for (P * γ ). The primal-dual active set algorithm (PDAS) is related to the algorithms in [START_REF] Bergounioux | A comparison of a Moreau-Yosida-based active set strategy and interior point methods for constrained optimal control problems[END_REF][START_REF] Bergounioux | Primal-dual strategy for constrained optimal control problems[END_REF][START_REF] Hintermüller | A primal-dual active set algorithm for bilaterally control constrained optimal control problems[END_REF][START_REF] Hintermüller | A semi-smooth Newton method for constrained linearquadratic control problems[END_REF][START_REF] Ito | Semi-smooth Newton methods for variational inequalities of the first kind[END_REF] in the context of constrained optimal control and obstacle problems. It is an iterative algorithm which uses the current variables λ k , ξ k for (P * γ ) to predict new active sets A k+1 -, A k+1 + for the constrained optimization problem (P * γ ), whereas this prediction is motivated from expressing the complementarity condition in the form (3.2c). On these active sets the variable λ k+1 is fixed. Thus in each iteration step the method requires solving the equality constrained problem sup

λ∈L 2 (Γ f ) J * γ (λ) s.t. λ = -g on A k+1 -, λ = g on A k+1 + , (4.1)
which admits a unique solution. Note that, compared to inequality constrained optimization, equality constrained problems are significantly easier to handle, both theoretically and numerically. The algorithm is specified next.

Algorithm 1: (PDAS)

1. Choose y 0 ∈ {y ∈ Y : ∂y ∂n |Γ f ∈ L 2 (Γ f )}, σ > 0 and set λ 0 := -∂y 0 ∂n |Γ f , ξ 0 := τ f y 0 + γ -1 ( λ -λ 0 ), k := 0. 2. Determine A k+1 -= {x ∈ Γ f : ξ k + σ(λ k + g) < 0}, A k+1 + = {x ∈ Γ f : ξ k + σ(λ k -g) > 0}, I k+1 = Γ f \ (A k+1 - ∪ A k+1 + ). 3. If k ≥ 1, A k+1 - = A k -, and A k+1 + = A k + stop, else
4. Solve problem (4.1) for λ k+1 on I k+1 and the corresponding y k+1 ∈ Y and update

ξ k+1 = ⎧ ⎨ ⎩ τ f y k+1 + γ -1 ( λ + g) on A k+1 -, τ f y k+1 + γ -1 ( λ -g) on A k+1
+ , 0 on I k+1 , k := k + 1 and goto step 2. Note that ξ k+1 is the Lagrange multiplier for the equality constraints in (4.1). The justification of the stopping criterion in step 3 of (PDAS) is given in the following lemma (see also [START_REF] Bergounioux | Primal-dual strategy for constrained optimal control problems[END_REF]). The proof relies on the fact that, if the active sets coincide for two consecutive iterations, the quantities ξ and λ satisfy the sign-structure as required by the complementarity conditions (3.3).

Lemma 4.1. If Algorithm (PDAS) stops, the last iterate is the solution to system (3.2a)-(3.2c).

We now discuss the influence of the parameter σ on the iteration sequence for k ≥ 1. On I k we have that ξ k = 0 and thus σ has no influence when determining the new active and inactive sets. On A k -we have λ k = -g and distinguish two cases: The set where ξ k < 0 belongs to A k+1 -for the next iteration independently from σ.

In case ξ k > 0 we have ξ k + σ(λ k -g) = ξ k -2σg. The set where ξ k -2σg ≤ 0 moves to I k+1 if ξ k -2σg > 0 to A k+1 +
for the next iteration. Hence, only in this case σ influences the sequence of iterates. Smaller values for σ make it more likely that points belong to A k -∩ A k+1 + . A similar observation as for A k -holds true for A k + , which shows that with σ > 0 one can control the probability that points are shifted from one active set to the other within one iteration. We also remark that, if for some

σ := σ 1 > 0 one has A k -∩ A k+1 + = A k + ∩ A k+1 - = ∅, then for every σ ≥ σ 1 also A k -∩ A k+1 + = A k + ∩ A k+1 - =
∅ and the sets A k+1 -, A k+1 + , and I k+1 are the same for all σ ≥ σ 1 . This observation will be of interest regarding our local convergence analysis of (PDAS).

Semismooth Newton method for (P *

γ ). This section applies an infinitedimensional semismooth Newton method (SS) to (P * γ ). We use the differentiability concept as introduced in [START_REF] Hintermüller | The primal-dual active set strategy as a semismooth Newton method[END_REF], which we recall for the reader's convenience later in this section.

We start with writing the optimality system (3.2a)-(3.2c) as one nonlinear operator equation utilizing (3.4). For this purpose we denote by ỹ the solution to the problem

a(y, v) -(f, v) L 2 (Ω) = 0 for all v ∈ Y.
Further we introduce B -1 ∈ L(H -1 2 , Y ), the solution mapping for the variational equality

a(y, v) -λ, τ f v H -1 2 ,H 1 2 = 0 for all v ∈ Y for given λ ∈ H -1 2 (Γ f ).
We can now define the Neumann-to-Dirichlet operator

C := τ f B -1 |L 2 (Γ f ) ∈ L(L 2 (Γ f ), L 2 (Γ f )) (4.2)
and summarize some of its properties in the next lemma. Proof. Self-adjointness, positive definiteness, and injectivity follow easily from the properties of a(• , •). Sobolev's embedding theorem implies the compactness of C.

With the help of the operators B -1 and C one can write the solution y to e(y, λ) = 0 in Y * for given λ ∈ L 2 (Γ f ) as y = -B -1 λ + ỹ and τ f y as -Cλ + τ f ỹ. This allows elimination of the variable τ f y in (3.4). We introduce the mapping F :

L 2 (Γ f ) -→ L 2 (Γ f ) by F (λ) = Cλ -τ f ỹ -γ -1 ( λ -λ) + max(0, -Cλ + τ f ỹ + γ -1 ( λ -g)) + min(0, -Cλ + τ f ỹ + γ -1 ( λ + g)). (4.3)
Note that F (λ) = 0 characterizes λ as the solution of (P * γ ). In what follows we utilize for S ⊂ Γ f the extension-by-zero operator

E S : L 2 (S) -→ L 2 (Γ f ) defined by E S (g)(x) := g(x) if x ∈ S, 0 else. (4.4) Its adjoint operator E * S : L 2 (Γ f ) -→ L 2 (S)
is the restriction operator onto S. Writing the optimality system as done in (4.3) suggests applying a semismooth Newton method to solve F (λ) = 0. We briefly summarize those facts on semismooth Newton methods which are relevant for the following results. Let X, Y, and Z be Banach spaces and F : D ⊂ X -→ Z be a nonlinear mapping with open domain D.

Definition 4.3. The mapping

F : D ⊂ X -→ Z is called Newton differentiable on the open subset U ⊂ D if there exists a mapping G : U -→ L(X, Z) such that lim h→0 1 h F (x + h) -F (x) -G(x + h)h = 0 (4.5)
for every x ∈ U .

The mapping G in the above definition is referred to as generalized derivative. The following convergence result for a generalized Newton method holds (see [START_REF] Chen | Smoothing methods and semismooth methods for nondifferentiable operator equations[END_REF]).

Theorem 4.4. Suppose that x * ∈ D is a solution to F (x) = 0 and that F is Newton differentiable in an open neighborhood U containing x * and that { G(x) -1 :

x ∈ U } is bounded. Then the Newton-iteration

x k+1 = x k -G(x k ) -1 F (x k ) (4.6)
converges superlinearly to x * provided that x 0x * is sufficiently small.

To apply a Newton iteration to the mapping F , we need to consider Newton differentiability of the max-and min-operator. For this purpose let X denote a function space of real-valued functions on some Ω ⊂ R n , and further max(0, y) and min(0, y) the pointwise max-and min-operations, respectively. We now introduce candidates for the generalized derivatives

G max (y)(x) = 1 if y(x) ≥ 0, 0 if y(x) < 0, G min (y)(x) = 1 if y(x) ≤ 0, 0 if y(x) > 0. (4.7)
Then we have the following result (see [START_REF] Hintermüller | The primal-dual active set strategy as a semismooth Newton method[END_REF]).

Theorem 4.5. The mappings max(0, •) : L q (Ω) -→ L p (Ω) and min(0, •) : L q (Ω) -→ L p (Ω) with 1 ≤ p < q < ∞ are Newton differentiable on L q (Ω) with generalized derivatives G max and G min , respectively.

Note that Theorem 4.5 requires a norm gap (i.e., p < q) to hold true. In [START_REF] Hintermüller | The primal-dual active set strategy as a semismooth Newton method[END_REF] it is shown that the functions defined in (4.7) cannot serve as generalized gradients if p ≥ q. We now quote a chain rule for Newton differentiability (for a proof see [START_REF] Ito | Semi-smooth Newton methods for variational inequalities of the first kind[END_REF]).

Theorem 4.6. Let F 2 : Y -→ X be an affine mapping with F 2 y = By + b, B ∈ L(Y, X), b ∈ X, and assume that F

1 : D ⊂ X -→ Z is Newton differentiable on the open subset U ⊂ D with generalized derivative G. If F -1 2 (U ) is nonempty, then F = F 1 • F 2 is Newton differentiable on F -1
2 (U ) with generalized derivative given by G(By + b)B ∈ L(Y, Z) for y ∈ F -1 2 (U ). We can now apply the above results to the mapping F . Observe that Rg(C) ⊂ H 1 2 (Γ f ) and that

H 1 2 (Γ f ) → L q (Γ f ) for q = 2(n-1) n-2 if n ≥ 3, q < ∞ if n = 2, (4.8)
where n ≥ 2 denotes the dimension of Ω. Note that q > 2 for all n ≥ 2. From Theorems 4.5 and 4.6 it follows that F is Newton differentiable on L 2 (Γ f ). A generalized derivative of F is given by

G F (λ)(δ) = E I E * I C + 1 γ δ (4.9)
with the following definition for A -, A + , I:

A -= {x ∈ Γ f : -Aλ + τ f ỹ + γ -1 ( λ -g) ≥ 0}, A + = {x ∈ Γ f : -Aλ + τ f ỹ + γ -1 ( λ + g) ≤ 0}, I = Γ f \ (A -∪ A + ).
Calculating (4.6) explicitly results in a semismooth Newton-iteration step for the solution of F (λ) = 0 that is equal to one iteration step of (PDAS) with σ = γ -1 .

An analogous result for unilaterally constrained optimal control problems was established in [START_REF] Hintermüller | The primal-dual active set strategy as a semismooth Newton method[END_REF]. Note that the norm gap required for Newton differentiability of the max-and min-function results from directly exploiting the smoothing property of the operator C. This has become possible since we chose σ := γ -1 in (3.2c) which allowed elimination of the explicit appearance of λ in the max-and min-function. Taking advantage of this fact, the above semismooth Newton method does not require a smoothing step, as do the semismooth Newton methods in [START_REF] Ulbrich | Semismooth Newton methods for operator equations in function spaces[END_REF].

We now investigate whether (PDAS) with arbitrary σ > 0 can also be interpreted as a Newton method. We introduce F :

Y × L 2 (Γ f ) × L 2 (Γ f ) -→ Y * × L 2 (Γ f ) × L 2 (Γ f ) by F (y, λ, ξ) := ⎛ ⎝ e(y, λ) τ f y + γ -1 ( λ -λ) -ξ ξ -max(0, ξ + σ(λ -g)) -min(0, ξ + σ(λ + g)) ⎞ ⎠ (4.10)
and observe that F (y, λ, ξ) = 0 characterizes y and λ as solutions to (P γ ) and (P * γ ), respectively. Applying now the Newton iteration (4.6) with the generalized derivative of the max-and min-function as given in (4.7) to the mapping F results in Algorithm (PDAS) which can be seen similarly as for (SS). In section 5.2 it is shown that for certain problems, (PDAS) converges locally superlinearly without the necessity of a smoothing step as used in [START_REF] Ulbrich | Semismooth Newton methods for operator equations in function spaces[END_REF] to get local superlinear convergence of semismooth Newton methods.

We conclude this section with some remarks on the development of semismooth Newton methods. The application of generalized Newton methods for semismooth problems in finite dimensions has a rather long history (see, e.g., [START_REF] Facchinei | Finite-Dimensional Variational Inequalities and Complementarity Problems[END_REF][START_REF] Qi | Convergence analysis of some algorithms for solving nonsmooth equations[END_REF][START_REF] Qi | A nonsmooth version of Newton's method[END_REF] and the references given there). Recently, in [START_REF] Chen | Smoothing methods and semismooth methods for nondifferentiable operator equations[END_REF][START_REF] Hintermüller | The primal-dual active set strategy as a semismooth Newton method[END_REF][START_REF] Kummer | Generalized Newton and NCP-methods: Convergence, regularity, actions[END_REF][START_REF] Ulbrich | Semismooth Newton methods for operator equations in function spaces[END_REF] concepts for generalized derivatives in infinite dimensions were introduced. Our work uses the notion of slant differentiability in a neighborhood as proposed in [START_REF] Hintermüller | The primal-dual active set strategy as a semismooth Newton method[END_REF], which is a slight adaptation of the terminology introduced in [START_REF] Chen | Smoothing methods and semismooth methods for nondifferentiable operator equations[END_REF], where the term slant differentiability at a point is also introduced. A similar concept is proposed in [START_REF] Kummer | Generalized Newton and NCP-methods: Convergence, regularity, actions[END_REF], where the name "Newton map" is coined. Applications of such pointwise approaches to Newton's method, however, presuppose knowledge of the solution. The differentiability concept in [START_REF] Hintermüller | The primal-dual active set strategy as a semismooth Newton method[END_REF] coincides with a specific application of the theory developed in [START_REF] Ulbrich | Semismooth Newton methods for operator equations in function spaces[END_REF]; we refer to the discussion on this relationship in [START_REF] Hintermüller | The primal-dual active set strategy as a semismooth Newton method[END_REF]. As in [START_REF] Ito | Semi-smooth Newton methods for variational inequalities of the first kind[END_REF] and also motivated by [START_REF] Kummer | Generalized Newton and NCP-methods: Convergence, regularity, actions[END_REF], we use instead of the notion slant differentiability in a neighborhood the name Newton differentiability.

Augmented Lagrangian methods for (P *

). Augmented Lagrangian methods (ALMs) combine ordinary Lagrangian methods and penalty methods without suffering of the disadvantages of these methods. For instance, the augmented Lagrangian method converges without requiring that the penalty parameter tends to infinity. For a detailed discussion of these methods we refer to [START_REF] Bertsekas | Constraint Optimization and Lagrange Multipliers[END_REF][START_REF] Ito | Augmented Lagrangian methods for nonsmooth, convex optimization in Hilbert spaces[END_REF].

To argue the close relation of the regularization for (P * ) to augmented Lagrangians recall that (3.2b), (3.2c) can equivalently be expressed as (3.4) and, after multiplication with γ, as

λ γ = γτ f y γ + λ -max(0, γτ f y γ + λ -g) -min(0, γτ f y γ + λ + g). (4.11)
The augmented Lagrangian method is an iterative algorithm for the calculation of λ in (P * ).

It sets λ := λ l in (4.11) and determines λ l+1 from the solution of (4.11), (3.2a). Note that the augmented Lagrangian method can be seen as an implicit version of Uzawa's algorithm (see [START_REF] Ito | Augmented Lagrangian methods for nonsmooth, convex optimization in Hilbert spaces[END_REF]). The whole method is specified next.

Algorithm 3: (ALM) 1. Choose γ > 0, λ 0 ∈ L 2 (Γ f ) and set l := 0.

Solve for (y

l+1 , λ l+1 , ξ l+1 ) ∈ Y × L 2 (Γ f ) × L 2 (Γ f ) system (3.2a)-(3.2c
) with λ := λ l . 3. Update l := l + 1 and goto step 2. The auxiliary problem in step 2 of (ALM) has exactly the form of our regularized problem and can thus efficiently be solved using (PDAS) or (SS). The question arises concerning the precision to which the system in step 2 is solved. Several strategies are possible, such as solving the system exactly for all l or performing only one iteration step of the semismooth Newton method in each iteration. We tested several strategies and report on them in section 6. Note that in (ALM) the regularization parameter γ plays the role of a penalty parameter, which is not necessarily taken to infinity; nevertheless (ALM) detects the solution of (P * ), as will be shown in section 5.4.

Convergence analysis.

In this section we present local convergence results for (SS) and (PDAS) as well as a conditional global convergence result for (SS) and unconditional global convergence of (ALM).

Local superlinear convergence of (SS).

In this section we give a local convergence result for algorithm (SS) for the solution of the regularized friction problem.

Theorem 5.1. If λ 0λ γ L 2 (Γ f ) is sufficiently small, then the iterates λ k of (SS) converge to (λ γ ) superlinearly in L 2 (Γ f ). Furthermore, the corresponding primal iterates y k converge superlinearly to y γ in Y .

Proof. We have only to show superlinear convergence of λ k to λ γ in L 2 (Γ f ); then superlinear convergence of y k to y γ in Y ⊂ H 1 (Ω) follows since B -1 is continuous.

We already argued Newton differentiability of F ∈ L(L 2 (Γ f ), L 2 (Γ f )). To apply Theorem 4.4 it remains to verify that the generalized gradients G F ∈ L(L 2 (Γ f ), L 2 (Γ f )) of F have uniformly bounded inverses. Recall the definition of the extension-by-zero operator E . and its adjoint E * . as given in (4.4). Let (h A -, h A + , h I ) ∈ L 2 (A -) × L 2 (A + ) × L 2 (I) and consider the equation

G F (λ)(δ) = G F (λ)(δ A -, δ A + , δ I ) = (h A -, h A + , h I ). (5.1)
Recalling the explicit form (4.9) of G F , we get from (5.1) that δ A -= γh A -and δ A + = γh A + must hold; further

1 γ + E * I CE I δ I = h I -γE * I CE A -h A --γE * I CE A + h A + .
Due to the positivity of C we can define a new scalar product • , • on L 2 (I) by

x, y := 1 γ + E * I CE I x, y L 2 (I)
for x, y ∈ L 2 (I).

Utilizing the positivity of C we have that the product • , • is coercive with constant γ -1 independently from I. Applying the Lax-Milgram lemma, one finds not only that (5.1) admits a unique solution δ I , but also that

δ I L 2 (I) ≤ γ h I L 2 (I) + γ 2 C L(L 2 (Γ f )) h A -L 2 (A -) + h A + L 2 (A + ) .
This proves the uniform boundedness of G F (λ) -1 with respect to λ ∈ L 2 (Γ f ) and ends the proof.

Local superlinear convergence of (PDAS)

. As observed at the end of section 4, algorithm (PDAS) cannot directly be interpreted as a locally superlinear convergent semismooth Newton method if no smoothing steps are used. However, exploiting the role of σ in (PDAS) (see the discussion after Lemma 4.1), it turns out that local superlinear convergence holds for (PDAS) as well, provided the dimension n of Ω is 2.

Corollary 5.2. Assume that n = 2 and Γ 0 ⊂ Γ is a sufficiently regular subset.

If λ 0 -λ γ L 2 (Γ f ) is sufficiently small, the iterates (y k , λ k ) of (PDAS) with σ ≥ γ -1 converge superlinearly in Y × L 2 (Γ f ).
Proof. The idea of this proof is to show that in a neighborhood of the solution λ γ the iterates λ k of (PDAS) coincide with λ k from (SS), which allows application of Theorem 5.1 also for (PDAS).

Step 1. We first consider only (SS) and denote by δ > 0 the convergence radius of this semismooth Newton method. We introduce a δ 0 with 0 < δ 0 ≤ δ, which will be further specified below, and choose

λ 0 ∈ L 2 (Γ f ) such that λ 0 -λ γ L 2 (Γ f ) ≤ δ 0 .
Since δ 0 ≤ δ the method converges and λ kλ k+1 L 2 (Γ f ) ≤ 2δ 0 for k ≥ 1. Note that the difference of the corresponding variables y ky k+1 solves

a(y k -y k+1 , v) + (λ k -λ k+1 , τ f v) L 2 (Γ f ) = 0 for all v ∈ Y.
It thus follows from regularity results for mixed elliptic problems [START_REF] Savaré | Regularity and perturbation results for mixed second order elliptic problems[END_REF] that

y k -y k+1 C 0 ( Ω) ≤ C λ k -λ k+1 L 2 (Γ f ) for some C > 0.
For the corresponding traces we have

τ f (y k -y k+1 ) C 0 (Γ f ) ≤ C λ k -λ k+1 L 2 (Γ f ) ≤ 2Cδ 0 . (5.2)
We now show that for δ 0 sufficiently small A k -∩ A k+1

+ = A k + ∩ A k+1 - = ∅.
We prove this claim by contradiction; i.e., we assume that

J = A k + ∩ A k+1 - = ∅.
Then, almost everywhere on J we have

τ y k-1 + γ -1 ( λ -g) > 0 and τ y k + γ -1 ( λ + g) < 0, which implies τ (y k+1 -y k ) > 2gγ -1 . Thus, utilizing (5.2) 2gγ -1 < τ (y k+1 -y k ) C 0 (Γ f ) ≤ 2Cδ 0 . (5.3) If we choose δ 0 ≤ g Cγ , relation (5.
3) cannot hold true and therefore J = ∅. An analogous observation holds true for A k -∩ A k+1 + , which shows that

A k -∩ A k+1 + = A k + ∩ A k+1 - = ∅ if δ 0 ≤ g Cγ . (5.4)
Step 2. Recall that the iterates of (PDAS) with σ = γ -1 coincide with those of (SS). Thus, if

L 2 (Γ f ) λ 0 -λ γ ≤ δ 0 , then A k -∩ A k+1 + = A k + ∩ A k+1 - = ∅ for (PDAS) with σ = γ -1 .
It follows from the discussion after Lemma 4.1 that for the active sets calculated from (PDAS) using σ ≥ γ -1 also A k -∩ A k+1

+ = A k + ∩ A k+1 - = ∅
holds. This shows that (SS) and (PDAS) determine the same iterates for the variable λ γ provided that λ 0λ γ L 2 (Γ f ) < δ 0 . Hence, superlinear L 2 -convergence for λ k determined from (PDAS) holds. For the variables y k superlinear convergence in Y follows from the continuity of the solution mapping B -1 .

Conditional global convergence of (SS).

Our global convergence result is based on an appropriately defined functional which decays when evaluated along the iterates of the algorithm. A related strategy to prove global convergence (i.e., convergence from arbitrary initialization) is used in [START_REF] Ito | The primal-dual active set method for nonlinear optimal control problems with bilateral constraints[END_REF] in the context of optimal control problems. In what follows we use the notation from (PDAS) with σ := γ -1 for (SS).

For (λ, ξ) ∈ L 2 (Γ f ) × L 2 (Γ f ) we define the functional M (λ, ξ) := 1 γ 2 Γ f |(λ -g) + | 2 + |(λ + g) -| 2 dx + A * + |ξ -| 2 dx + A * - |ξ + | 2 dx, (5.5)
where A * + = {x ∈ Γ f : λ(x) ≥ g} and A * -= {x ∈ Γ f : λ(x) ≤ -g}. By (•) + and (•) -we denote the positive and negative part, i.e., (•) + := max(0, •) and (•) -:= min(0, •). As a preparatory step for the following estimates we prove a lemma that can easily be verified using the spectral theorem for compact and positive definite operators.

Lemma 5.3. Let X be a real Hilbert space with inner product (• , •) and C ∈ L(X) be injective, self-adjoint, positive, and compact. Then

(y, y) ≤ C L(X) (C -1 y, y)
for all y ∈ Rg(C).

Following Lemma 4.2 the Neumann-to-Dirichlet mapping C, as given in (4.2), fulfills the conditions of Lemma 5.3. Utilizing the operator C step 4 of (PDAS) implies

C -1 τ f y k+1 = -λ k+1 = - ⎧ ⎪ ⎨ ⎪ ⎩ g on A k+1 + , γτ f y k+1 + λ on I k+1 , -g on A k+1 -, τ f y k+1 + γ -1 ( λ -λ k+1 ) -ξ k+1 = 0. (5.6)
With the above notation we get

C -1 (τ f (y k -y k+1 )) = λ k+1 -λ k = ⎧ ⎪ ⎨ ⎪ ⎩ R k A + on A k+1 + , γ(τ f (y k+1 -y k )) + R k I on I k+1 , R k A - on A k+1 -, (5.7)
where

R k A + = ⎧ ⎪ ⎨ ⎪ ⎩ 0 o n A k+1 + ∩ A k + , g -λ k < 0 on A k+1 + ∩ I k , 2g < γξ k on A k+1 + ∩ A k -, R k I = ⎧ ⎪ ⎨ ⎪ ⎩ γτ f y k + λ -g = γξ k ≤ 0 on I k+1 ∩ A k + , 0 o n I k+1 ∩ I k , γξ k ≥ 0 o nI k+1 ∩ A k -, R k A + = ⎧ ⎪ ⎨ ⎪ ⎩ -2g > γξ k on A k+1 - ∩ A k + , -g -λ k > 0 on A k+1 - ∩ I k , 0 o nA k+1 - ∩ A k -.
Let us denote by R k the function defined on Γ f , whose restrictions to A k+1 -, I k+1 , and

A k+1 + coincide with R k A -, R k I , and R A k -, respectively. Note that, from the definition of R k , we have R k 2 L 2 (Γ f ) ≤ γ 2 M (λ k , ξ k ). (5.8)
To shorten the notation we introduce δ k y := τ f (y k+1y k ). Multiplying (5.7) by -δ k y results in

C -1 (δ k y )(δ k y ) = -R k δ k y -χ I k+1 γ(δ k y ) 2
a.e. on Γ f , where χ I k+1 denotes the characteristic function for I k+1 . Thus,

(C -1 δ k y , δ k y ) L 2 (Γ f ) = Γ f -R k δ k y dx -γ I k+1 (δ k y ) 2 dx ≤ R k L 2 (Γ f ) δ k y L 2 (Γ f ) , (5.9)
where we used the Cauchy-Schwarz inequality and I k+1 (δ k y ) 2 dx ≥ 0. Utilizing Lemma 5.3 for the Neumann-to-Dirichlet mapping C and (5.9) yields

δ k y L 2 (Γ f ) ≤ C L(L 2 (Γ f )) R k L 2 (Γ f ) . (5.10)
We can now prove the following convergence theorem for (SS), or equivalently for (PDAS), with σ = γ -1 .

Theorem 5.4.

If γ < C -1 L(L 2 (Γ f )) , then M (λ k+1 , ξ k+1 ) < M(λ k , ξ k ) for k = 0, 1, 2, . . . with (λ k , ξ k ) = (λ γ , ξ γ ), where (λ k , ξ k ) denote the iterates of (PDAS) with σ = γ -1 . Moreover, (y k , λ k , ξ k ) converges to (y γ , λ γ , ξ γ ) strongly in Y × L 2 (Γ f ) × L 2 (Γ f ).
Proof. Recall that from the definition of (PDAS) with σ = γ -1 one gets

λ k+1 = γτ f y k+1 + λ on I k+1 , ξ k+1 = τ f y k+1 + γ -1 ( λ + g) on A k+1 -, ξ k+1 = τ f y k+1 + γ -1 ( λ -g) on A k+1 + .
We therefore have

ξ k+1 = δ k y + τ f y k + γ -1 ( λ -g) = δ k y + ⎧ ⎪ ⎨ ⎪ ⎩ ξ k -γ -1 (g -λ k ) > 0 on A k+1 + ∩ A k -, γ -1 (λ k -g) > 0 on A k+1 + ∩ I k , ξ k > 0 o nA k+1 + ∩ A k + . Thus, |(ξ k+1 ) -| := | max(0, -ξ k+1 )| ≤| δ k y | a.e. on A k+1 + . Note that A * ,k+1 + := {x ∈ Γ f : λ k+1 (x) ≥ g} = A k+1 + ∪ {x ∈ I k+1 : λ k+1 (x) ≥ g},
which implies, using ξ k+1 = 0 on I k+1 , that

|(ξ k+1 ) -| ≤| δ k y | a.e. on A * ,k+1 + . (5.11)
Analogously, it follows that

|(ξ k+1 ) + | ≤| δ k y | a.e. on A * ,k+1 - , (5.12)
where A * ,k+1 -

:= {x ∈ Γ f : λ k+1 (x) ≤ -g}. Moreover, on I k+1 λ k+1 -g = γδ k y + γτ f y k + λ -g = γδ k y + ⎧ ⎪ ⎨ ⎪ ⎩ γ(ξ k + γ -1 (λ k -g)) ≤ 0 on I k+1 ∩ A k -, λ k -g ≤ 0 o nI k+1 ∩ I k , γξ k ≤ 0 o nI k+1 ∩ A k + .
The above estimate shows that Since on active sets λ k+1 is set to either g or -g, we have on A k+1 -∪ A k+1 + that (λ k+1g) + = (λ k+1 + g) -= 0. Further, at most one of the expressions at a.a.

|(λ k+1 -g) + | ≤ γ|δ k y | a.
x ∈ Γ f |(λ k+1 -g) + |, |(λ k+1 + g) -|, |(ξ k+1 ) -|, |(ξ k+1 ) + |
can be strictly positive, which shows, combining (5.11)- (5.14), that

M (λ k+1 , ξ k+1 ) ≤ δ k y 2 L 2 (Γ f ) . (5.15)
Combining (5.8) and (5.10) with (5.15) shows that

M (λ k+1 , ξ k+1 ) ≤ γ 2 C 2 L(L 2 (Γ f )) M (λ k , ξ k ). (5.16)
Our assumption on γ implies that

C 2 L(L 2 (Γ f )) γ 2 < 1, (5.17)
which shows that

M (λ k+1 , ξ k+1 ) < M(λ k , ξ k ) unless (λ k , ξ k ) = (λ γ , ξ γ ).
Combining (5.8), (5.10), (5.15), and (5.16) it follows that

δ k y 2 L 2 (Γ f ) ≤ C 2 L(L 2 (Γ f )) R k 2 L 2 (Γ f ) ≤ γ 2 C 2 L(L 2 (Γ f )) M (λ k , ξ k ) ≤ γ 2 C 2 L(L 2 (Γ f )) δ k-1 y 2 L 2 (Γ f ) ≤ γ C L(L 2 (Γ f )) 2(k+1) M (λ 0 , ξ 0 ), (5.18)
which shows, utilizing (5.17), that lim k→∞ M (λ k , ξ k ) = lim k→∞ R k L 2 (Γ f ) = 0. Further, summing up (5.18) over k and utilizing (5.17) results in

∞ k=1 δ k y 2 L 2 (Γ f ) < ∞, which shows that there exists a z ∈ L 2 (Γ f ) such that lim k→∞ τ f y k = z in L 2 (Γ f ). Using (5.7) results in λ k+1 -λ k L 2 (Γ f ) ≤ γ δ k y L 2 (Γ f ) + R k L 2 (Γ f ) ≤ γ C L(L 2 (Γ f )) k (γ 2 C L(L 2 (Γ f )) + γ)M (λ 0 , ξ 0 ) 1 2 ,
and thus there exists λ ∈ L 2 (Γ f ) with lim k→∞ λ k = λ in L 2 (Γ f ). From (5.6) one gets

lim k→∞ ξ k = ξ ∈ L 2 (Γ f ) for ξ ∈ L 2 (Γ f ). Since 0 = lim k→∞ M (λ k , ξ k ) = M ( λ, ξ), the pair ( λ, ξ) satisfies condition (3.2c). From (3.2a) follows the existence of ỹ ∈ Y such that lim k→∞ y k = y in Y . Note that, since (y k , λ k , ξ k ) satisfies (3.2a), (3.2b)
, this is also the case for (y, λ, ξ). Hence (y, λ, ξ) = (y γ , λ γ , ξ γ ) due to the uniqueness of a solution to (3.2a)-(3.2c), which ends the proof. Note that for unilaterally constrained problems global convergence results can possibly be gained using monotonicity properties of the involved operators (see, e.g., [START_REF] Ito | Semi-smooth Newton methods for variational inequalities of the first kind[END_REF]), where the maximum principle for the Laplace operator is used to prove global convergence. For bilaterally constrained problems (such as (P * γ )), however, monotonicity of the iterates does not hold, even if the operator satisfies a maximum principle.

Global convergence of (ALM).

The next theorem states global convergence of (ALM) for all γ > 0 and shows that large γ increases the speed of convergence. In the statement of the next theorem we denote the coercivity constant of a(• , •) on Y by ν > 0.

Theorem 5.5. The iterates λ l of (ALM) and the corresponding variables y l satisfy

ν y l+1 -ȳ 2 H 1 (Ω) + 1 2γ λ l+1 -λ 2 L 2 (Γ f ) ≤ 1 2γ λ l -λ 2 L 2 (Γ f ) (5.19) and ν ∞ k=1 y l+1 -ȳ 2 H 1 (Ω) ≤ 1 2γ λ 0 -λ 2 L 2 (Γ f ) , (5.20)
which implies that y l -→ ȳ strongly in Y and λ l λ weakly in L 2 (Γ f ). Proof. From the fact that ȳ and λ are the solutions to (P) and (P * ), respectively, it follows that (5.21) and since y l+1 and λ l+1 solve (P γ ) and (P * γ ) with λ := λ l , we infer

a(ȳ, y l+1 -ȳ) -(f, y l+1 -ȳ) L 2 (Ω) + ( λ, τ f (y l+1 -ȳ)) L 2 (Γ f ) = 0,
a(y l+1 , y l+1 -ȳ) -(f, y l+1 -ȳ) L 2 (Ω) + (λ l+1 , τ f (y l+1 -ȳ)) L 2 (Γ f ) = 0. (5.22) Subtracting (5.21) from (5.22) results in a(y l+1 -ȳ, y l+1 -ȳ) + (λ l+1 -λ, τ f (y l+1 -ȳ)) L 2 (Γ f ) = 0. (5.23)
Note that one can write (4.11) and (2.6) as λ l+1 = P (γτ f y l+1 + λ l ) and λ = P (γτ f ȳ + λ), (5.24) where P : L 2 (Γ f ) → L 2 (Γ f ) denotes the pointwise projection onto the convex set {v ∈ L 2 (Γ f ) : |v| ≤ g a.e. on L 2 (Γ f )}. Thus we get

(λ l+1 -λ, τ f (y l+1 -ȳ)) L 2 (Γ f ) = γ -1 (λ l+1 -λ, (γτ f y l+1 + λ l ) -(γτ f ȳ + λ)) L 2 (Γ f ) -γ -1 (λ l+1 -λ, λ l -λ) L 2 (Γ f ) ≥ γ -1 λ l+1 -λ 2 L 2 (Γ f ) -γ -1 (λ l+1 -λ, λ l -λ) L 2 (Γ f ) ,
where we used that

(λ l+1 -λ, (γτ f y l+1 + λ l -λ l+1 ) -(γτ f ȳ + λ -λ)) L 2 (Γ f ) ≥ 0,
which holds using (5.24) and since P is a projection onto a convex set. Using (5.23) and the coercivity of a(• , •) on Y , we get

ν y l+1 -ȳ 2 H 1 (Ω) ≤ a(y l+1 -ȳ, y l+1 -ȳ) = -(λ l+1 -λ, τ f (y l+1 -ȳ)) L 2 (Γ f ) ≤ - 1 γ λ l+1 -λ 2 L 2 (Γ f ) + 1 γ (λ l+1 -λ, λ l -λ) L 2 (Γ f ) ≤ - 1 2γ λ l+1 -λ 2 L 2 (Γ f ) + 1 2γ λ l -λ 2 L 2 (Γ f ) ,
which proves (5.19). Summing up (5. [START_REF] Hlaváček | Solution of Variational Inequalities in Mechanics[END_REF]) with respect to l, we obtain (5.20). 6. Numerical tests. In this section we present three test examples for the algorithms proposed in section 5 for the solution of (P * γ ) and (P * ). For simplicity we use for all examples the unit square as domain, i.e., Ω = (0, 1) × (0, 1) and the bilinear form a(y, z) := (∇y, ∇z) L 2 (Ω) + μ(y, z) L 2 (Ω)

for y, z ∈ Y , which is coercive if μ > 0 or Γ 0 ⊂ Γ has positive measure. For our calculations we utilize a finite difference discretization with the usual five-point stencil approximation to the Laplace operator. The discretization of the normal derivative is based on one-sided differences and all linear systems are solved exactly. We denote by N the number of gridpoints in one space dimension, which means we work on N × N -grids.

To investigate convergence properties we frequently report on

d l λ := λ -λ l L 2 (Γ f ) , (6.1)
where λ := λ 10 16 is the solution of (P * γ ) with γ = 10 16 and λ l denotes the actual iterate. We compare our results with those obtained using the Uzawa algorithm, which can be interpreted as an explicit form of the augmented Lagrangian method [START_REF] Ito | Augmented Lagrangian methods for nonsmooth, convex optimization in Hilbert spaces[END_REF]. While (ALM) converges for every γ > 0 the Uzawa method converges for only γ ∈ [α 1 , α 2 ] with 0 < α 1 < α 2 , where α 1 and α 2 are in general not known [START_REF] Glowinski | Numerical Analysis of Variational Inequalities[END_REF]. We initialize the Uzawa method with λ 0 := 0 and report on the number of iterations (one iteration requires one linear solve), where the iteration is stopped if d l λ < 10 -4 . Unless otherwise specified, we use λ = 0, and σ = 1 for (PDAS). As initialization for (PDAS), (SS), and (ALM), the solution to (3.2a)-(3.2c) with ξ 0 = 0 is used, which corresponds to the solution of (P * γ ) neglecting the constraints on λ. 6.1. Example 1. This example is taken from [START_REF] Glowinski | Numerical Analysis of Variational Inequalities[END_REF]. The data are as follows: Γ f = ([0, 1] × {0}) ∪ ([0, 1] × {1}), g = 1.5, μ = 0, and

f (x) = 10 if x ∈ (0, 1 2 ) × (0, 1), -10 if x ∈ [ 1 2 , 1) × (0, 1).
Choosing N = 80 the Uzawa algorithm requires 32 iterations for γ = 10 and 17 iterations for γ = 20 and does not converge for γ = 30. In our tests for (PDAS) and (SS) we vary the value for the regularization parameter γ and investigate the convergence as γ → ∞. Table 6.1 reports on the number of iterations needed by (SS) for various values of γ and N = 80. It can be seen that the algorithm requires only very few iterations to find the solution and that increasing the regularization parameter for this example does not increase the number of iterations required to detect the solution (cf. [START_REF] Ito | Semi-smooth Newton methods for variational inequalities of the first kind[END_REF], where a different behavior for obstacle problems is observed). We remark that for (SS) no points are shifted from the lower active set to the upper or conversely within one iteration and thus (PDAS) determines the same iterates as (SS) for all σ ≥ γ -1 . 2.54e-4 10 5

2.54e-5 10 6

2.54e-6 The primal solution y γ for γ = 10 8 is shown in Figure 6.1 (left). We also investigate the convergence as γ → ∞. The table in Figure 6.1 reports on the value of |||y γ -ȳ||| := (a(y γȳ, y γȳ))

1 2
for various γ, where we take ȳ := y 10 16 as approximation to the solution of the simplified friction problem and use N = 160. Note that ||| • ||| is a norm equivalent to the usual one in H 1 (Ω). The result suggests the convergence rate γ -1 , while from Corollary 3.4 we get only the rate γ -1 2 . 6.2. Example 2. This example investigates the behavior of (PDAS), (SS), and (ALM) for a more complicated structure of the active and inactive sets (see the solution y γ for γ = 10 10 in Figure 6.2 (left)). Uzawa's method faces serious troubles with this example: In all test examples with γ > 0.2 the method did not converge. For γ = 0.2 we stopped our test after 400 iterations at d 400 λ =1.03e-2. We choose Γ f = ∂Ω, which implies Y = H 1 (Ω); and further μ = 0.5, g = 0.4, and the external force f (x) = 10(sin 4πx + cos 4πx).

We investigate superlinear convergence of the iterates, properties of (PDAS) and (SS), and the behavior of algorithm (ALM). Table 6.2 reports on for γ = 50. We observe superlinear convergence of the iterates determined with (SS). Table 6.3 shows the number of iterations #iter SS and #iter PD required by (SS) and (PDAS), respectively, to find the solution for different values of γ. We observe a slight increase in the number of iterations as γ increases. For γ ≥ 160 (SS) does not detect the solution, whereas (PDAS) does. Using (SS) for these examples we can observe the following behavior: Points in Γ f move from A k-1 -to A k + , and then from A k + back to A k+1 -for some k ≥ 2, and due to this scattering the algorithm does not find the solution (cf. the remark on the role of σ in (PDAS) after Lemma 4.1). Algorithm (PDAS) with σ = 1 does not experience such problems and finds the solution after a few iterations for all tested γ > 0.

q k λ := λ k -λ γ L 2 (Γ f ) λ k-1 -λ γ L 2 (Γ f ) , k = 1, 2, . . . ,
To avoid possible difficulties due to the local convergence of (SS), we test two globalization strategies: First we use a continuation procedure with respect to γ, motivated from the local convergence result for (SS). We solve for γ = 150 and use the solution as initialization for the algorithm with larger γ. This procedure turns out to be successful for only a moderate increase in γ. Increasing γ moderately, typically only one or two more iterations are needed to find the solution for larger γ. However, this method appears inconvenient and costly. Next we test backtracking with J γ as merit function to globalize (SS). This strategy works successfully, but in particular for larger γ, several backtracking steps are necessary in each iteration. The resulting stepsize is very small and thus overall up to 50 iterations are needed to find the solution. This behavior becomes more distinct for large γ.

We also apply algorithm (ALM) for the solution of this example. In a first attempt we solve the auxiliary problem in (ALM) exactly using (PDAS), whereas this method is initialized with the solution of the auxiliary problem in the previous iteration step of (ALM). Due to the local superlinear convergence of (PDAS), the auxiliary problem is solved in very few iterations, as can be seen in Table 6.4, where for γ = 10 2 and γ = 10 4 we report on the number of iterations #iter P D required by (PDAS) in every step l of (ALM). Further we report on d l λ as defined in (6.1). We observe a monotone decrease of d l λ and a faster convergence in the case that γ = 10 4 . In a second approach we test an inexact version of the augmented Lagrangian method: We stop the (PDAS)-iterations for the auxiliary problem as soon as the initial residual in (3.2c) has been reduced at least by a factor of 2. The results for γ = 10 2 , 10 4 are shown in Table 6.5, where we report on the number of (PDAS)-iterations and the value of d l λ . We observe that for γ = 10 2 the first iterates present a better approximation to λ than for γ = 10 4 , whereas then the case γ = 10 4 shows a faster convergence behavior. This leads to the idea of increasing the parameter γ in every step of (ALM). Choosing γ = 10 l in the lth (ALM)-iteration, the impressing results shown in the last line of Table 6.5 were obtained. We investigate the number of iterations required by (PDAS) and (SS) for various values of γ and N ; further we report on results obtained with (ALM). In a series of test runs (Table 6.6) we investigate the number of iterations for various grids and different values for γ. We observe the low number of iterations for all mesh-sizes and choices for γ. For the calculations in Table 6.6 we use (SS), except for those indicated by * . For these examples with a rather large value of γ, (SS) starts to chatter due to effects described in the previous example. Thus we utilize (PDAS) to solve these problems, which is always successful. Utilizing (PDAS) also for the examples with smaller γ yields the same number of iterations as (SS). Further, note from Table 6.6 that the number of iterations increases very weakly as the mesh becomes finer. We again test (ALM) with (PDAS) for the auxiliary problem. In the case that this inner problem is solved exactly, the overall number of system solves is 16 for γ = 50 and between 10 and 20 for other tested values of γ, where we used d l λ < 10 -4 as stopping criterion and N = 160. The results for the case where the auxiliary problem is solved approximately in every (ALM)-iteration are summarized in Table 6.7, where we again report on the number of (PDAS)-iterations and on d l λ as defined in (6.1). Again increasing γ as in Example 6.2 turns out to be very efficient.

6.4. Summary of the numerical results. In our numerical testing we observe a remarkable efficiency of algorithms (SS) and (PDAS) for the solution of the regularized simplified friction problem (P * γ ) and of (ALM) for the solution of (P * ). For moderate values of γ, the iterates for (SS) and (PDAS) coincide and these algorithms converge superlinearly. For large values of γ, (SS) may start to chatter, while (PDAS) always detects the solution. The two tested globalization strategies for (SS) turn out to be successful but inconvenient. The number of iterations of the semismooth Newton methods increases only slightly for finer grid and larger regularization parameter. The efficiency of (SS) and (PDAS) is interesting also with respect to augmented Lagrangian methods since these algorithms present a powerful tool to solve or approximately solve the auxiliary problem in (ALM). Our tests show that, solving the auxiliary problem in (ALM) only approximately using (SS) or (PDAS), the overall number of system solves for (ALM) is rather the same as for the semismooth Newton methods with large γ. However, (ALM) has the advantage that it detects the solution of the dual (P * ) of the original simplified friction problem without requiring that γ → ∞. Finally, we remark the advantage of (PDAS) with large γ that one has a simple stopping criterion at hand that guarantees that the exact solution of (P * γ ) is detected.

τ

  f ȳ ≤ 0 a.e. on A -:= {x ∈ Γ f : λ = -g a.e. on Γ f }, τ f ȳ = 0 a.e. on I := {x ∈ Γ f : | λ| < g a.e. on Γ f }, τ f ȳ ≥ 0 a.e. on A + := {x ∈ Γ f : λ = g a.e. on Γ f }.

Lemma 4 . 2 .

 42 The Neumann-to-Dirichlet operator defined in (4.2) is self-adjoint, positive definite, injective, and compact.

  e. on I k+1 , (5.13) and analogously one can show |(λ k+1 + g) -| ≤ γ|δ k y | a.e. on I k+1 . (5.14)

Fig. 6 . 1 .Fig. 6 . 2 .

 6162 Fig. 6.1. Solution y γ for γ = 10 8 (left) and convergence with respect to γ (right) for Example 1.

6. 3 .

 3 Example 3. The solution y 10 10 for this last example is shown in Figure6.2 (right). Again the Uzawa algorithm only converges for small γ which results in an extremely slow convergence. The data are as follows: Γ f = ∂Ω, μ = 0.5, g = 0.3, and f (x) = |3x -1| + 2sgn(2y -1) + 2sgn(x -0.75) + 5 sin(6πx).

Table 6 . 1

 61 Number of iterations for different values of γ for Example 1.

	γ	10 2	10 4	10 6	10 8
	No. of iterations	2	3	3	3

Table 6 . 2

 62 Values for q k λ in Example 2, γ = 50.

	k	1	2	3	4	5
	q k λ	0.58	0.45	0.25	0.18	0.00

Table 6 . 3

 63 Number of iterations of (SS) and (PDAS) for different values of γ for Example 2, N = 160.

	γ	3	5	10	50	100	150	160	10 3	10 10
	#iter SS	3	4	4	5	6	7	div	div	div
	#iter PD	3	4	4	5	6	5	5	6	6

Table 6 . 4

 64 Tests for (ALM) with exact solve of the auxiliary problem for Example 2, N = 160.

		l	1	2	3	4	5	6	7
	γ = 10 2	#iter P D d l λ	6 2.55e-2	3 8.54e-3	2 3.62e-3	1 1.62e-3	1 7.45e-4	1 3.58e-4	1 1.77e-4
	γ = 10 4	#iter P D d l λ	6 4.00e-4	1 3.06e-6	1 2.67e-8	1 2.62e-10	1 2.84e-12

Table 6 . 5

 65 Tests for (ALM) with inexact solve of the auxiliary problem for Example 2, N = 160.

		l	1	2	3	4	5	6	7
	γ = 10 2	#iter P D d l λ	1 2.96e-1	2 5.03e-2	2 7.60e-3	2 1.89e-3	1 9.99e-4	1 5.36e-4	1 2.91e-4
	γ = 10 4	#iter P D d l λ	1 3.81e-1	2 1.46e-1	1 3.79e-2	2 1.87e-4	1 2.20e-6	1 2.67e-8	1 3.28e-10
	γ = 10 l	#iter P D d l λ	1 1.41e-1	3 2.30e-2	2 2.16e-3	1 1.11e-5	1 1.04e-8	1 1.14e-12

Table 6 . 6

 66 Number of iterations for different values of γ (first line) and N (first column) for Example 3.

		5	10	30	50	10 2	10 3	10 5	10 10
	20	3	3	3	3	3	3	3	3 *
	40	3	3	4	5	4	4	4	4 *
	80	3	4	4	5	5	6	6	6 *
	160	3	3	5	5	6	8	7 *	7 *
	320	3	4	5	6	7	7	8 *	8 *

Table 6 . 7

 67 Tests for (ALM) with inexact solve of the auxiliary problem for Example 3, N = 160.

		l	1	2	3	4	5	6	7
	γ = 10 2	#iter P D d l λ	1 1.62-1	2 1.99e-2	1 6.94e-3	1 1.40e-3	1 4.67e-4	1 1.91e-4	2 9.20e-5
	γ = 10 4	#iter P D d l λ	1 2.14e-1	3 1.46e-2	2 4.11e-4	1 9.06e-7	1 8.20e-9	1 8.43e-11
	γ = 10 l	#iter P D d l λ	1 8.54e-2	2 2.62e-2	2 2.40e-3	1 4.21e-4	1 9.08e-8	1 8.23e-12

This work was supported by the "Fonds zur Förderung der wissenschaftlichen Forschung" under "SRC 03, Optimization and Control."