Solving Semi-Linear Elliptic Optimal Control Problems with L1-Cost via Regularization and RAS-Preconditioned Newton Methods

Abstract

We present a new parallel computational framework for the efficient solution of a class of L2/L1-regularized optimal control problems governed by semi-linear elliptic partial differential equations (PDEs). The main difficulty in solving this type of problem is the nonlinearity and non-smoothness of the L1-term in the cost functional, which we address by employing a combination of several tools. First, we approximate the non-differentiable projection operator appearing in the optimality system by an appropriately chosen regularized operator and establish convergence of the resulting system's solutions. Second, we apply a continuation strategy to control the regularization parameter to improve the behavior of (damped) Newton methods. Third, we combine Newton's method with a domain-decomposition-based nonlinear preconditioning, which improves its robustness properties and allows for parallelization. The efficiency of the proposed numerical framework is demonstrated by extensive numerical experiments.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…