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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
