Solving semi-linear elliptic optimal control problems with $$L^1$$-cost via regularization and RAS-preconditioned newton methods

Abstract We present a new parallel computational framework for the efficient solution of a class of $$\varvec{L}^{\varvec{2}}$$ / $$\varvec{L}^{\varvec{1}}$$ -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 $$\varvec{L}^{\varvec{1}}$$ -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.

Authors

Institutions

Publication Details

Journal
Numerical Algorithms
Published
2025-10-15
DOI
https://doi.org/10.1007/s11075-025-02209-3
Primary Topic
Advanced Numerical Methods in Computational Mathematics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Solving semi-linear elliptic optimal control problems with $$L^1$$-cost via regularization and RAS-preconditioned newton methods

Gabriele Ciaramella, Michael Kartmann, Georg Müller
Numerical Algorithms
Advanced Numerical Methods in Computational Mathematics
article

Solving semi-linear elliptic optimal control problems with $$L^1$$-cost via regularization and RAS-preconditioned newton methods

Gabriele Ciaramella, Michael Kartmann, Georg Müller
article en

Abstract

Abstract We present a new parallel computational framework for the efficient solution of a class of $$\varvec{L}^{\varvec{2}}$$ / $$\varvec{L}^{\varvec{1}}$$ -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 $$\varvec{L}^{\varvec{1}}$$ -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.

Numerical Algorithms
Heidelberg University (DE)
Openalex Percentile: Top 69%
Advanced Numerical Methods in Computational Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.