×

A posteriori error control of a state constrained elliptic control problem. (English) Zbl 1161.65049

The authors study the a posteriori error control of a state constrained elliptic control problem. First they give the mathematical setting of the problem, then they sketch the finite element discretization of the problem and derive the corresponding optimality system and state some properties of the discrete approximations to \(y, p, u\) and to the Lagrange multipliers \(\mu^{a}, \mu^{b}\) corresponding to the lower and upper state constraint. Later they specify the local error indicators and test their effectivity by means of numerical examples.

MSC:

65K10 Numerical optimization and variational techniques
49J20 Existence theories for optimal control problems involving partial differential equations
49M25 Discrete approximations in optimal control
Full Text: DOI

References:

[1] Becker R., East-West J. Numer. Math. 4 (4) pp 237– (1996)
[2] DOI: 10.1137/S1052623498343131 · Zbl 1001.49034 · doi:10.1137/S1052623498343131
[3] DOI: 10.1137/0331044 · Zbl 0798.49020 · doi:10.1137/0331044
[4] DOI: 10.1137/060652361 · doi:10.1137/060652361
[5] M. Hintermüller, R. H. W. Hoppe, Y. Iliash, and M. Kieweg, An a posteriori error analysis of adaptive finite element methods for distributed elliptic control problems with control constraints. ESAIM, Control Optim. Calc. Var. (2007), DOI: 10.1051/cocv:2007057.10.1051/cocv:2007057 · Zbl 1239.49041
[6] DOI: 10.1007/s10589-005-4559-5 · Zbl 1074.65069 · doi:10.1007/s10589-005-4559-5
[7] DOI: 10.1023/A:1014239012739 · Zbl 1008.49024 · doi:10.1023/A:1014239012739
[8] DOI: 10.1137/070683416 · Zbl 1169.65068 · doi:10.1137/070683416
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.