Adaptive Multilevel Trust-Region Methods for Time-Dependent PDE-Constrained Optimization

We present a class of adaptive multilevel trust-region methods for the efficient solution of optimization problems governed by time–dependent nonlinear partial differential equations with control constraints. The algorithm is based on the ideas of the adaptive multilevel inexact SQP-method from [26, 27]. It is in particular well suited for problems with time–dependent PDE constraints. Instead of the quasi-normal step in a classical SQP method which results in solving the linearized PDE sufficiently well, in this algorithm a (nonlinear) solver is applied to the current discretization of the PDE. Moreover, different discretizations and solvers for the PDE and the adjoint PDE may be applied. The resulting inexactness of the reduced gradient in the current discretization is controlled within the algorithm. Thus, highly efficient PDE solvers can be coupled with the proposed optimization framework. The algorithm starts with a coarse discretization of the underlying optimization problem and provides during the optimization process implementable criteria for an adaptive refinement strategy of the current discretization based on error estimators. We prove global convergence to a stationary point of the infinitedimensional problem. Moreover, we illustrate how the adaptive refinement strategy of the algorithm can be implemented by using a posteriori error estimators for the state and the adjoint equation. Numerical results for a semilinear parabolic PDE–constrained problem with pointwise control constraints are presented. Mathematics Subject Classification (2010). 90C55 49M05 49M25 49M37