-

 

 

 




Optimization Online





 

On Solving Elliptic Obstacle Problems by Compact Abs-Linearization

Olga Weiß(olga.weiss***at***hu-berlin.de)
Monika Weymuth(monika.weymuth***at***unibw.de)

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 compact abs-linearized problems. Each of these compact abs-linearized problems can be solved by classical means. The comprehensive algorithmic concept is presented and its performance is discussed through examples.

Keywords: Variational Inequality, Obstacle Problem, Constrained Optimal Control, Finite Ele- ment Method, Nonsmooth Optimization, Abs-Linearization, A Priori Error Analysis

Category 1: Convex and Nonsmooth Optimization (Nonsmooth Optimization )

Category 2: Infinite Dimensional Optimization

Citation: 1: Institut für Mathematik, Humboldt-Universität zu Berlin 2: Institut für Mathematik und Computergestützte Simulation, Universität der Bundeswehr München

Download: [PDF]

Entry Submitted: 01/24/2021
Entry Accepted: 01/24/2021
Entry Last Modified: 01/24/2021

Modify/Update this entry


  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository

 

Submit
Update
Policies
Coordinator's Board
Classification Scheme
Credits
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society