arXiv subjects

Michael Hintermüller

Publications and source records attributed to Michael Hintermüller.

At least 37 records · Page 2Linked to original sources

arXiv2024

Data-driven methods for quantitative imaging

In the field of quantitative imaging, the image information at a pixel or voxel in an underlying domain entails crucial information about the imaged matter. This is particularly important in medical imaging applications, such as quantitative Magnetic Resonance Imaging (qMRI), where quantitative maps of biophysical parameters can characterize the imaged tissue and thus lead to more accurate diagnoses. Such quantitative values can also be useful in subsequent, automatized classification tasks in order to discriminate normal from abnormal tissue, for instance. The accurate reconstruction of these quantitative maps is typically achieved by solving two coupled inverse problems which involve a (forward) measurement operator, typically ill-posed, and a physical process that links the wanted quantitative parameters to the reconstructed qualitative image, given some underlying measurement data. In this review, by considering qMRI as a prototypical application, we provide a mathematically-oriented overview on how data-driven approaches can be employed in these inverse problems eventually improving the reconstruction of the associated quantitative maps.

math.OC↗

arXiv2023

Optimal boundary control of the isothermal semilinear Euler equation for gas dynamics on a network

The analysis and boundary optimal control of the nonlinear transport of gas on a network of pipelines is considered. The evolution of the gas distribution on a given pipe is modeled by an isothermal semilinear compressible Euler system in one space dimension. On the network, solutions satisfying (at nodes) the so called Kirchhoff flux continuity conditions are shown to exist in a neighborhood of an equilibrium state. The associated nonlinear optimization problem then aims at steering such dynamics to a given target distribution by means of suitable (network) boundary controls while keeping the distribution within given (state) constraints. The existence of local optimal controls is established and a corresponding Karush-Kuhn-Tucker (KKT) stationarity system with an almost surely non-singular Lagrange multiplier is derived.

math.OC↗

arXiv2022

Optimality Conditions and Moreau--Yosida Regularization for Almost Sure State Constraints

We analyze a potentially risk-averse convex stochastic optimization problem, where the control is deterministic and the state is a Banach-valued essentially bounded random variable. We obtain strong forms of necessary and sufficient optimality conditions for problems subject to equality and conical constraints. We propose a Moreau--Yosida regularization for the conical constraint and show consistency of the optimality conditions for the regularized problem as the regularization parameter is taken to infinity.

math.OC↗

arXiv2022

First-order conditions for the optimal control of learning-informed nonsmooth PDEs

In this paper we study the optimal control of a class of semilinear elliptic partial differential equations which have nonlinear constituents that are only accessible by data and are approximated by nonsmooth ReLU neural networks. The optimal control problem is studied in detail. In particular, the existence and uniqueness of the state equation are shown, and continuity as well as directional differentiability properties of the corresponding control-to-state map are established. Based on approximation capabilities of the pertinent networks, we address fundamental questions regarding approximating properties of the learning-informed control-to-state map and the solution of the corresponding optimal control problem. Finally, several stationarity conditions are derived based on different notions of generalized differentiability.

math.OC↗

arXiv2022

A descent algorithm for the optimal control of ReLU neural network informed PDEs based on approximate directional derivatives

We propose and analyze a numerical algorithm for solving a class of optimal control problems for learning-informed semilinear partial differential equations. The latter is a class of PDEs with constituents that are in principle unknown and are approximated by nonsmooth ReLU neural networks. We first show that a direct smoothing of the ReLU network with the aim to make use of classical numerical solvers can have certain disadvantages, namely potentially introducing multiple solutions for the corresponding state equation. This motivates us to devise a numerical algorithm that treats directly the nonsmooth optimal control problem, by employing a descent algorithm inspired by a bundle-free method. Several numerical examples are provided and the efficiency of the algorithm is shown.

math.OC↗

arXiv2021

Optimal control and directional differentiability for elliptic quasi-variational inequalities

We focus on elliptic quasi-variational inequalities (QVIs) of obstacle type and prove a number of results on the existence of solutions, directional differentiability and optimal control of such QVIs. We give three existence theorems based on an order approach, an iteration scheme and a sequential regularisation through partial differential equations. We show that the solution map taking the source term into the set of solutions of the QVI is directionally differentiable for general data and locally Hadamard differentiable obstacle mappings, thereby extending in particular the results of our previous work which provided the first differentiability result for QVIs in infinite dimensions. Optimal control problems with QVI constraints are also considered and we derive various forms of stationarity conditions for control problems, thus supplying among the first such results in this area.

math.OC↗

arXiv2021

On the differentiability of the minimal and maximal solution maps of elliptic quasi-variational inequalities

In this note, we prove that the minimal and maximal solution maps associated to elliptic quasi-variational inequalities of obstacle type are directionally differentiable with respect to the forcing term and for directions that are signed. Along the way, we show that the minimal and maximal solutions can be seen as monotone limits of solutions of certain variational inequalities and that the aforementioned directional derivatives can also be characterised as the monotone limits of sequences of directional derivatives associated to variational inequalities. We conclude the paper with some examples and an application to thermoforming.

math.AP↗

arXiv2021

Differentiability properties for boundary control of fluid-structure interactions of linear elasticity with Navier-Stokes equations with mixed-boundary conditions in a channel

In this paper we consider a fluid-structure interaction problem given by the steady Navier Stokes equations coupled with linear elasticity taken from [Lasiecka, Szulc, and Zochoswki, Nonl. Anal.: Real World Appl., 44, 2018]. An elastic body surrounded by a liquid in a rectangular domain is deformed by the flow which can be controlled by the Dirichlet boundary condition at the inlet. On the walls along the channel homogeneous Dirichlet boundary conditions and on the outflow boundary do-nothing conditions are prescribed. We recall existence results for the nonlinear system from that reference and analyze the control to state mapping generalizing the results of [Wollner and Wick, J. Math. Fluid Mech., 21, 2019] to the setting of the nonlinear Navier-Stokes equation for the fluid and the situation of mixed boundary conditions in a domain with corners.

math.OC↗

arXiv2021

Dualization and Automatic Distributed Parameter Selection of Total Generalized Variation via Bilevel Optimization

Total Generalized Variation (TGV) regularization in image reconstruction relies on an infimal convolution type combination of generalized first- and second-order derivatives. This helps to avoid the staircasing effect of Total Variation (TV) regularization, while still preserving sharp contrasts in images. The associated regularization effect crucially hinges on two parameters whose proper adjustment represents a challenging task. In this work, a bilevel optimization framework with a suitable statistics-based upper level objective is proposed in order to automatically select these parameters. The framework allows for spatially varying parameters, thus enabling better recovery in high-detail image areas. A rigorous dualization framework is established, and for the numerical solution, two Newton type methods for the solution of the lower level problem, i.e. the image reconstruction problem, and two bilevel TGV algorithms are introduced, respectively. Denoising tests confirm that automatically selected distributed regularization parameters lead in general to improved reconstructions when compared to results for scalar parameters.

math.OC↗

arXiv2020

Stability of the solution set of quasi-variational inequalities and optimal control

For a class of quasi-variational inequalities (QVIs) of obstacle-type the stability of its solution set and associated optimal control problems are considered. These optimal control problems are non-standard in the sense that they involve an objective with set-valued arguments. The approach to study the solution stability is based on perturbations of minimal and maximal elements of the solution set of the QVI with respect to {monotone} perturbations of the forcing term. It is shown that different assumptions are required for studying decreasing and increasing perturbations and that the optimization problem of interest is well-posed.

math.OC↗

arXiv2020

Existence, iteration procedures and directional differentiability for parabolic QVIs

We study parabolic quasi-variational inequalities (QVIs) of obstacle type. Under appropriate assumptions on the obstacle mapping, we prove the existence of solutions of such QVIs by two methods: one by time discretisation through elliptic QVIs and the second by iteration through parabolic variational inequalities (VIs). Using these results, we show the directional differentiability (in a certain sense) of the solution map which takes the source term of a parabolic QVI into the set of solutions, and we relate this result to the contingent derivative of the aforementioned map. We finish with an example where the obstacle mapping is given by the inverse of a parabolic differential operator.

math.OC↗

arXiv2019

Directional differentiability for elliptic quasi-variational inequalities of obstacle type

The directional differentiability of the solution map of obstacle type quasi-variational inequalities (QVIs) with respect to perturbations on the forcing term is studied. The classical result of Mignot is then extended to the quasi-variational case under assumptions that allow multiple solutions of the QVI. The proof involves selection procedures for the solution set and represents the directional derivative as the limit of a monotonic sequence of directional derivatives associated to specific variational inequalities. Additionally, estimates on the coincidence set and several simplifications under higher regularity are studied. The theory is illustrated by a detailed study of an application to thermoforming comprising of modelling, analysis and some numerical experiments.

math.OC↗

arXiv2019

Variable step mollifiers and applications

We consider a mollifying operator with variable step that, in contrast to the standard mollification, is able to preserve the boundary values of functions. We prove boundedness of the operator in all basic Lebesgue, Sobolev and BV spaces as well as corresponding approximation results. The results are then applied to extend recently developed theory concerning the density of convex intersections.

math.FA↗

arXiv2019

Simulation and Control of a Nonsmooth Cahn-Hilliard Navier-Stokes System

We are concerned with the simulation and control of a two phase flow model governed by a coupled Cahn-Hilliard Navier-Stokes system involving a nonsmooth energy potential. We establish the existence of optimal solutions and present two distinct approaches to derive suitable stationarity conditions for the bilevel problem, namely C- and strong stationarity. Moreover, we demonstrate the numerical realization of these concepts at the hands of two adaptive solution algorithms relying on a specifically developed goal-oriented error estimator. In addition, we present a model order reduction approach using proper orthogonal decomposition (POD-MOR) in order to replace high-fidelity models by low order surrogates. In particular, we combine POD with space-adapted snapshots and address the challenges which are the consideration of snapshots with different spatial resolutions and the conservation of a solenoidal property.

math.OC↗

arXiv2019

Quantitative Magnetic Resonance Imaging: From Fingerprinting to Integrated Physics-Based Models

Quantitative magnetic resonance imaging (qMRI) is concerned with estimating (in physical units) values of magnetic and tissue parameters e.g., relaxation times $T_1$, $T_2$, or proton density $ρ$. Recently in [Ma et al., Nature, 2013], Magnetic Resonance Fingerprinting (MRF) was introduced as a technique being capable of simultaneously recovering such quantitative parameters by using a two step procedure: (i) given a probe, a series of magnetization maps are computed and then (ii) matched to (quantitative) parameters with the help of a pre-computed dictionary which is related to the Bloch manifold. In this paper, we first put MRF and its variants into a perspective with optimization and inverse problems to gain mathematical insights concerning identifiability of parameters under noise and interpretation in terms of optimizers. Motivated by the fact that the Bloch manifold is non-convex and that the accuracy of the MRF-type algorithms is limited by the "discretization size" of the dictionary, a novel physics-based method for qMRI is proposed. In contrast to the conventional two step method, our model is dictionary-free and is rather governed by a single non-linear equation, which is studied analytically. This non-linear equation is efficiently solved via robustified Newton-type methods. The effectiveness of the new method for noisy and undersampled data is shown both analytically and via extensive numerical examples for which also improvement over MRF and its variants is documented.

math.OC↗

arXiv2017

A function space framework for structural total variation regularization with applications in inverse problems

In this work, we introduce a function space setting for a wide class of structural/weighted total variation (TV) regularization methods motivated by their applications in inverse problems. In particular, we consider a regularizer that is the appropriate lower semi-continuous envelope (relaxation) of a suitable total variation type functional initially defined for sufficiently smooth functions. We study examples where this relaxation can be expressed explicitly, and we also provide refinements for weighted total variation for a wide range of weights. Since an integral characterization of the relaxation in function space is, in general, not always available, we show that, for a rather general linear inverse problems setting, instead of the classical Tikhonov regularization problem, one can equivalently solve a saddle-point problem where no a priori knowledge of an explicit formulation of the structural TV functional is needed. In particular, motivated by concrete applications, we deduce corresponding results for linear inverse problems with norm and Poisson log-likelihood data discrepancy terms. Finally, we provide proof-of-concept numerical examples where we solve the saddle-point problem for weighted TV denoising as well as for MR guided PET image reconstruction.

math.OC↗

arXiv2016

Analytical aspects of spatially adapted total variation regularisation

In this paper we study the structure of solutions of the one dimensional weighted total variation regularisation problem, motivated by its application in signal recovery tasks. We study in depth the relationship between the weight function and the creation of new discontinuities in the solution. A partial semigroup property relating the weight function and the solution is shown and analytic solutions for simply data functions are computed. We prove that the weighted total variation minimisation problem is well-posed even in the case of vanishing weight function, despite the lack of coercivity. This is based on the fact that the total variation of the solution is bounded by the total variation of the data, a result that it also shown here. Finally the relationship to the corresponding weighted fidelity problem is explored, showing that the two problems can produce completely different solutions even for very simple data functions.

math.OC↗

arXiv2015

Optimal Control of a Semidiscrete Cahn-Hilliard-Navier-Stokes System with Non-Matched Fluid Densities

This paper is concerned with the distributed optimal control of a time-discrete Cahn--Hilliard/Navier--Stokes system with variable densities. It focuses on the double-obstacle potential which yields an optimal control problem for a family of coupled systems in each time instance of a variational inequality of fourth order and the Navier--Stokes equation. By proposing a suitable time-discretization, energy estimates are proved and the existence of solutions to the primal system and of optimal controls is established for the original problem as well as for a family of regularized problems. The latter correspond to Moreau--Yosida type approximations of the double-obstacle potential. The consistency of these approximations is shown and first order optimality conditions for the regularized problems are derived. Through a limit process, a stationarity system for the original problem is established which is related to a function space version of C-stationarity.

math.AP↗