Prof. Maya G. Neytcheva, gave a lecture titled “On the Numerical Solution of StateConstrained Optimal Control Problems” at AMSS on 24, August 2018. Optimal control problems with constraints given by a partial differential equation arise in many different types of important applications. The problem involves both a state and a control variable, and a Lagrange multiplier to cope with the constraint. We consider problems, where in addition the state variable is constrained by lower and upper bounds. Such problems are harder to solve than when the box constraint holds only for the control variable. The problem must be regularized, both to limit the cost of the optimal control variable, normally by use of a standard Tikhonov regularization term in the objective function to be minimized, and by a regularization for the state variable to handle the box constraint. The algebraic problem that arises after discretization is nonlinear and is solved using the socalled semismooth Newton method. Clearly, due to the large size of the soobtained linear systems to be solved at each Newton step, iterative methods are the methods of choice. The latter inevitably requires utilization of robust and numerically and computationally efficient preconditioners. In this talk, they addressed an efficient preconditioning technique for twobytwo block matrices with square blocks, amended for the particular problem in focus. They also discussed the interplay between the discretization parameter, the two regularization parameters, the stopping criteria for the linear and nonlinear solvers, as well as constructing good enough initial guess to ensure fast convergence of the nonlinear solver. The theoretical analysis of the properties of the preconditioner and the robustness of the overall solution procedure was illustrated with numerical experiments. Prof. Maya G. Neytcheva is from department of Information Technology, Uppsala University, Uppsala, Sweden.
