pith. machine review for the scientific record. sign in

arxiv: 1611.04286 · v2 · pith:UVZH4CUPnew · submitted 2016-11-14 · 🧮 math.OC

A FE-ADMM algorithm for Lavrentiev-regularized state-constrained elliptic control problem

classification 🧮 math.OC
keywords discretizationerrorhadmmalgorithmsconstraintscontroldifferentelliptic
0
0 comments X
read the original abstract

In this paper, elliptic control problems with pointwise box constraints on the state is considered, where the corresponding Lagrange multipliers in general only represent regular Borel measure functions. To tackle this difficulty, the Lavrentiev regularization is employed to deal with the state constraints. To numerically discretize the resulted problem, since the weakness of variational discretization in numerical implementation, full piecewise linear finite element discretization is employed. Estimation of the error produced by regularization and discretization is done. The error order of full discretization is not inferior to that of variational discretization because of the Lavrentiev-regularization. Taking the discretization error into account, algorithms of high precision do not make much sense. Utilizing efficient first-order algorithms to solve discretized problems to moderate accuracy is sufficient. Then a heterogeneous alternating direction method of multipliers (hADMM) is proposed. Different from the classical ADMM, our hADMM adopts two different weighted norms in two subproblems respectively. Additionally, to get more accurate solution, a two-phase strategy is presented, in which the primal-dual active set (PDAS) method is used as a postprocessor of the hADMM. Numerical results not only verify error estimates but also show the efficiency of the hADMM and the two-phase strategy.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.