An online adaptive finite-element method for nonsmooth PDE-constrained optimization

TL;DR

This paper introduces an adaptive finite-element method combined with trust-region algorithms to efficiently solve nonsmooth PDE-constrained optimization problems, balancing accuracy and computational cost.

Contribution

It develops a novel adaptive finite-element algorithm that handles nonsmooth, possibly nonconvex PDE-constrained optimization problems with automatic mesh refinement.

Findings

The method effectively refines discretization based on a posteriori error estimators.

Numerical experiments demonstrate high-resolution solutions for control and topology optimization.

The approach balances computational efficiency with solution accuracy.

Abstract

We present a trust-region-based adaptive finite-element algorithm for numerically solving a class of nonsmooth PDE-constrained optimization problems that includes problems with sparsifying regularizers and convex constraints. In particular, we consider the class of problems whose objective function is the sum of a smooth, possibly nonconvex, function and a nonsmooth extended real-valued convex function. Our method combines the robustness of inexact trust-region algorithms for nonsmooth problems with the efficiency of adaptive finite-element discretizations. Starting from a coarse mesh, the algorithm automatically refines the discretization based on reliable a posteriori error estimators for both the state and adjoint equations, systematically controlling the accuracy of the computed smooth objective function value and gradient. This adaptivity mechanism balances computational cost and solution accuracy, enabling high resolution of localized phenomena and sparsity structures in the state and control variables. We demonstrate the performance of our algorithm through numerical experiments on representative control and topology optimization examples.