State Constrained Optimization with Partial Differential Equations via Generalized Gradients
From MaRDI portal
Publication:6234590
arXiv1207.5390MaRDI QIDQ6234590FDOQ6234590
Authors: Richard C. Barnard 
Publication date: 23 July 2012
Abstract: We consider optimization problems constrained by partial differential equations (PDEs) with additional constraints placed on the solution of the PDEs. We develop a general and versatile framework using infinite-valued penalization functions and Clarke subgradients and apply this to problems with box constraints as well as more general constraints arising in applications, such as constraints on the average value of the state in subdomains. The framework also allows for problems with discontinuous data in the constraints. We present numerical results of this algorithm for the elliptic case and compare with other state-constrained algorithms.
Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53) Optimality conditions for problems involving partial differential equations (49K20)
This page was built for publication: State Constrained Optimization with Partial Differential Equations via Generalized Gradients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6234590)
