arXiv Analytics

Sign in

arXiv:1605.09750 [math.OC]AbstractReferencesReviewsResources

Nonconvex penalization of switching control of partial differential equations

Christian Clason, Armin Rund, Karl Kunisch

Published 2016-05-31Version 1

A standard approach to treat constraints in nonlinear optimization is penalization, in particular using $L^1$-type norms. Applying this approach to the pointwise switching constraint $u_1(t)u_2(t)=0$ leads to a nonsmooth and nonconvex infinite-dimensional minimization problem which is challenging both analytically and numerically. Adding $H^1$ regularization or restricting to a finite-dimensional control space allows showing existence of optimal controls. First order necessary optimality conditions are then derived using tools of nonsmooth analysis. Their solution can be computed using a combination of Moreau--Yosida regularization and a semismooth Newton method. Numerical examples illustrate the properties of this approach.

Related articles: Most relevant | Search more
arXiv:1702.07505 [math.OC] (Published 2017-02-24)
A convex penalty for switching control of partial differential equations
arXiv:2406.07997 [math.OC] (Published 2024-06-12)
Stabilizability of parabolic equations by switching controls based on point actuators
arXiv:2410.15146 [math.OC] (Published 2024-10-19)
Backstepping for Partial Differential Equations