An Efficient Nonmonotone Method for State-Constrained Elliptic Optimal Control Problems

Abstract

This paper presents a novel numerical strategy based on combination of an adaptive semismooth Newton (ASN) method and the Lavrentiev regularization technique for the solution of elliptic optimal control problems with state constraints. Using the global convergence proof for a nonmonotone semismooth Newton method, we will exploit an adaptive nonmonotone line search method such that the nonmonotonicity degree of this method can be increased when the results are far from the optimum solution and it can be reduced when they are close to the optimizer. In this strategy, the role of the Lavrentiev regularization technique is converting the original optimal control problem to a regularized optimal control problem. Using the finite difference discretization scheme and a Newton–Cotes rule, the regularized optimal control problem is converted to a bound constrained optimization problem (BCOP). Then the ASN method is implemented to solve the resulting BCOP. Numerical results show the efficiency of the proposed procedure.