DeepAI AI Chat
Log In Sign Up

A nonsmooth primal-dual method with simultaneous adaptive PDE constraint solver

by   Bjørn Jensen, et al.

We introduce an efficient first-order primal-dual method for the solution of nonsmooth PDE-constrained optimization problems. We achieve this efficiency through not solving the PDE or its linearisation on each iteration of the optimization method. Instead, we run the method in parallel with a simple conventional linear system solver (Jacobi, Gauss-Seidel, conjugate gradients), always taking only one step of the linear system solver for each step of the optimization method. The control parameter is updated on each iteration as determined by the optimization method. We prove linear convergence under a second-order growth condition, and numerically demonstrate the performance on a variety of PDEs related to inverse problems involving boundary measurements.


A primal dual projection algorithm for efficient constraint preconditioning

We consider a linear iterative solver for large scale linearly constrain...

Solving Inverse PDE Problems using Grid-Free Monte Carlo Estimators

Modeling physical phenomena like heat transport and diffusion is crucial...

An Outer-approximation Guided Optimization Approach for Constrained Neural Network Inverse Problems

This paper discusses an outer-approximation guided optimization method f...

A Primal-Dual Solver for Large-Scale Tracking-by-Assignment

We propose a fast approximate solver for the combinatorial problem known...

Discrete Empirical Interpolation and unfitted mesh FEMs: application in PDE-constrained optimization

In this work, we investigate the performance CutFEM as a high fidelity s...

Optimal and Adaptive Monteiro-Svaiter Acceleration

We develop a variant of the Monteiro-Svaiter (MS) acceleration framework...