A convex penalty for switching control of partial differential equations
Optimization and Control
2017-02-27 v1
Abstract
A convex penalty for promoting switching controls for partial differential equations is introduced; such controls consist of an arbitrary number of components of which at most one should be simultaneously active. Using a Moreau-Yosida approximation, a family of approximating problems is obtained that is amenable to solution by a semismooth Newton method. The efficiency of this approach and the structure of the obtained controls are demonstrated by numerical examples.
Keywords
Cite
@article{arxiv.1702.07505,
title = {A convex penalty for switching control of partial differential equations},
author = {Christian Clason and Armin Rund and Karl Kunisch and Richard C. Barnard},
journal= {arXiv preprint arXiv:1702.07505},
year = {2017}
}