A convex analysis approach to optimal controls with switching structure for partial differential equations

From MaRDI portal
Publication:2808060

DOI10.1051/COCV/2015017zbMATH Open1338.49056arXiv1702.07540OpenAlexW3103782052WikidataQ57432534 ScholiaQ57432534MaRDI QIDQ2808060FDOQ2808060


Authors: Christian Clason, Kazufumi Ito, Karl Kunisch Edit this on Wikidata


Publication date: 26 May 2016

Published in: European Series in Applied and Industrial Mathematics (ESAIM): Control, Optimization and Calculus of Variations (Search for Journal in Brave)

Abstract: Optimal control problems involving hybrid binary-continuous control costs are challenging due to their lack of convexity and weak lower semicontinuity. Replacing such costs with their convex relaxation leads to a primal-dual optimality system that allows an explicit pointwise characterization and whose Moreau-Yosida regularization is amenable to a semismooth Newton method in function space. This approach is especially suited for computing switching controls for partial differential equations. In this case, the optimality gap between the original functional and its relaxation can be estimated and shown to be zero for controls with switching structure. Numerical examples illustrate the effectiveness of this approach.


Full work available at URL: https://arxiv.org/abs/1702.07540




Recommendations




Cites Work


Cited In (21)





This page was built for publication: A convex analysis approach to optimal controls with switching structure for partial differential equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2808060)