On solving elliptic obstacle problems by constant abs-linearization
Publication date
2023-10-01
Document type
Forschungsartikel
Author
Weymuth, Monika
Organisational unit
Institut für Mathematik und Computergestützte Simulation, UniBw M
Publisher
Elsevier
Series or journal
Results in Control and Optimization
ISSN
Periodical volume
13
Article ID
100309
Peer-reviewed
✅
Part of the university bibliography
✅
Language
English
Abstract
We consider optimal control problems governed by an elliptic variational inequality of the first kind, namely the obstacle problem. The variational inequality is treated by penalization, which leads to optimization problems governed by a nonsmooth semi-linear elliptic PDE. The CALi algorithm is then applied for the efficient solution of these nonsmooth optimization problems. The special feature of the optimization algorithm CALi is the treatment of the nonsmooth Lipschitz-continuous operators abs, max and min, which allows to explicitly exploit the nonsmooth structure. Stationary points are located by appropriate decomposition of the optimization problem into so-called smooth constant abs-linearized problems. Each of these constant abs-linearized problems can be solved by classical means. The comprehensive algorithmic concept is presented, and its performance is discussed through examples.
Description
This is an open access article under the CC BY-NC-ND license (https://creativecommons.org/licenses/by-nc-nd/4.0/).
Version
Published version
Access right on openHSU
Metadata only access
