arXiv subjects

Martin Burger

Publications and source records attributed to Martin Burger.

At least 73 records · Page 4Linked to original sources

arXiv2020

Mean-field optimal control and optimality conditions in the space of probability measures

We derive a framework to compute optimal controls for problems with states in the space of probability measures. Since many optimal control problems constrained by a system of ordinary differential equations (ODE) modelling interacting particles converge to optimal control problems constrained by a partial differential equation (PDE) in the mean-field limit, it is interesting to have a calculus directly on the mesoscopic level of probability measures which allows us to derive the corresponding first-order optimality system. In addition to this new calculus, we provide relations for the resulting system to the first-order optimality system derived on the particle level, and the first-order optimality system based on $L^2$-calculus under additional regularity assumptions. We further justify the use of the $L^2$-adjoint in numerical simulations by establishing a link between the adjoint in the space of probability measures and the adjoint corresponding to $L^2$-calculus. Moreover, we prove a convergence rate for the convergence of the optimal controls corresponding to the particle formulation to the optimal controls of the mean-field problem as the number of particles tends to infinity.

math.OC↗

arXiv2020

Mean-field optimal control for biological pattern formation

We propose a mean-field optimal control problem for the parameter identification of a given pattern. The cost functional is based on the Wasserstein distance between the probability measures of the modeled and the desired patterns. The first-order optimality conditions corresponding to the optimal control problem are derived using a Lagrangian approach on the mean-field level. Based on these conditions we propose a gradient descent method to identify relevant parameters such as angle of rotation and force scaling which may be spatially inhomogeneous. We discretize the first-order optimality conditions in order to employ the algorithm on the particle level. Moreover, we prove a rate for the convergence of the controls as the number of particles used for the discretization tends to infinity. Numerical results for the spatially homogeneous case demonstrate the feasibility of the approach.

math.OC↗

arXiv2020

Coarse graining of a Fokker-Planck equation with excluded volume effects preserving the gradient-flow structure

The propagation of gradient flow structures from microscopic to macroscopic models is a topic of high current interest. In this paper we discuss this propagation in a model for the diffusion of particles interacting via hard-core exclusion or short-range repulsive potentials. We formulate the microscopic model as a high-dimensional gradient flow in the Wasserstein metric for an appropriate free-energy functional. Then we use the JKO approach to identify the asymptotics of the metric and the free-energy functional beyond the lowest order for single particle densities in the limit of small particle volumes by matched asymptotic expansions. While we use a propagation of chaos assumption at far distances, we consider correlations at small distance in the expansion. In this way we obtain a clear picture of the emergence of a macroscopic gradient structure incorporating corrections in the free energy functional due to the volume exclusion.

math.AP↗

arXiv2020

Structural analysis of an $L$-infinity variational problem and relations to distance functions

In this work we analyse the functional ${\cal J}(u)=\|\nabla u\|_\infty$ defined on Lipschitz functions with homogeneous Dirichlet boundary conditions. Our analysis is performed directly on the functional without the need to approximate with smooth $p$-norms. We prove that its ground states coincide with multiples of the distance function to the boundary of the domain. Furthermore, we compute the $L^2$-subdifferential of ${\cal J}$ and characterize the distance function as unique non-negative eigenfunction of the subdifferential operator. We also study properties of general eigenfunctions, in particular their nodal sets. Furthermore, we prove that the distance function can be computed as asymptotic profile of the gradient flow of ${\cal J}$ and construct analytic solutions of fast marching type. In addition, we give a geometric characterization of the extreme points of the unit ball of ${\cal J}$. Finally, we transfer many of these results to a discrete version of the functional defined on a finite weighted graph. Here, we analyze properties of distance functions on graphs and their gradients. The main difference between the continuum and discrete setting is that the distance function is not the unique non-negative eigenfunction on a graph.

math.AP↗

arXiv2020

Adaptive Superresolution in Deconvolution of Sparse Peaks

The aim of this paper is to investigate superresolution in deconvolution driven by sparsity priors. The observed signal is a convolution of an original signal with a continuous kernel.With the prior knowledge that the original signal can be considered as a sparse combination of Dirac delta peaks, we seek to estimate the positions and amplitudes of these peaks by solving a finite dimensional convex problem on a computational grid. Because, the support of the original signal may or may not be on this grid, by studying the discrete deconvolution of sparse peaks using L1-norm sparsity prior, we confirm recent observations that canonically the discrete reconstructions will result in multiple peaks at grid points adjacent to the location of the true peak. Owning to the complexity of this problem, we analyse carefully the de-convolution of single peaks on a grid and gain a strong insight about the dependence of the reconstructed magnitudes on the exact peak location. This in turn allows us to infer further information on recovering the location of the exact peaks i.e. to perform super-resolution. We analyze in detail the possible cases that can appear and based on our theoretical findings, we propose an self-driven adaptive grid approach that allows to perform superresolution in one-dimensional and multi-dimensional spaces. With the view that the current study can provide a further step in the development of more robust algorithms for the detection of single molecules in fluorescence microscopy or identification of characteristic frequencies in spectral analysis, we demonstrate how the proposed approach can recover sparse signals using simulated clusters of point sources (peaks) of low-resolution in one and two-dimensional spaces.

math.OC↗

arXiv2020

Network structured kinetic models of social interactions

The aim of this paper is to study the derivation of appropriate meso- and macroscopic models for interactions as appearing in social processes. There are two main characteristics the models take into account, namely a network structure of interactions, which we treat by an appropriate mesoscopic description, and a different role of interacting agents. The latter differs from interactions treated in classical statistical mechanics in the sense that the agents do not have symmetric roles, but there is rather an active and a passive agent. We will demonstrate how a certain form of kinetic equations can be obtained to describe such interactions at a mesoscopic level and moreover obtain macroscopic models from monokinetics solutions of those. The derivation naturally leads to systems of nonlocal reaction-diffusion equations (or in a suitable limit local versions thereof), which can explain spatial phase separation phenomena found to emerge from the microscopic interactions. We will highlight the approach in three examples, namely the evolution and coarsening of dialects in human language, the construction of social norms, and the spread of an epidemic.

math.AP↗

arXiv2020

Sequentially optimized projections in X-ray imaging

This work applies Bayesian experimental design to selecting optimal projection geometries in (discretized) parallel beam X-ray tomography assuming the prior and the additive noise are Gaussian. The introduced greedy exhaustive optimization algorithm proceeds sequentially, with the posterior distribution corresponding to the previous projections serving as the prior for determining the design parameters, i.e. the imaging angle and the lateral position of the source-receiver pair, for the next one. The algorithm allows redefining the region of interest after each projection as well as adapting parameters in the (original) prior to the measured data. Both A and D-optimality are considered, with emphasis on efficient evaluation of the corresponding objective functions. Two-dimensional numerical experiments demonstrate the functionality of the approach.

math.NA↗

arXiv2020

Asymptotic Profiles of Nonlinear Homogeneous Evolution Equations of Gradient Flow Type

This work is concerned with the gradient flow of absolutely $p$-homogeneous convex functionals on a Hilbert space, which we show to exhibit finite ($p<2$) or infinite extinction time ($p \geq 2$). We give upper bounds for the finite extinction time and establish convergence rates of the flow. Moreover, we study next order asymptotics and prove that asymptotic profiles of the solution are eigenfunctions of the subdifferential operator of the functional. To this end, we compare with solutions of an ordinary differential equation which describes the evolution of eigenfunction under the flow. Our work applies, for instance, to local and nonlocal versions of PDEs like $p$-Laplacian evolution equations, the porous medium equation, and fast diffusion equations, herewith generalizing many results from the literature to an abstract setting. We also demonstrate how our theory extends to general homogeneous evolution equations which are not necessarily a gradient flow. Here we discover an interesting integrability condition which characterizes whether or not asymptotic profiles are eigenfunctions.

math.AP↗

arXiv2020

Delayed Blow-Up for Chemotaxis Models with Local Sensing

The aim of this paper is to analyze a model for chemotaxis based on a local sensing mechanism instead of the gradient sensing mechanism used in the celebrated minimal Keller-Segel model. The model we study has the same entropy as the minimal Keller-Segel model, but a different dynamics to minimize this entropy. Consequently, the conditions on the mass for the existence of stationary solutions or blow-up are the same, however we make the interesting observation that with the local sensing mechanism the blow-up in the case of supercritical mass is delayed to infinite time. Our observation is made rigorous from a mathematical point via a proof of global existence of weak solutions for arbitrary large masses and space dimension. The key difference of our model to the minimal Keller-Segel model is that the structure of the equation allows for a duality estimate that implies a bound on the $(H^1)'$-norm of the solutions, which can only grow with a square-root law in time. This additional $(H^1)'$-bound implies a lower bound on the entropy, which contrasts markedly with the minimal Keller-Segel model for which it is unbounded from below in the supercritical case. Besides, regularity and uniqueness of solutions are also studied.

math.AP↗

arXiv2020

Data assimilation in price formation

We consider the problem of estimating the density of buyers and vendors in a nonlinear parabolic price formation model using measurements of the price and the transaction rate. Our approach is based on a work by Puel et al., see \cite{Puel2002}, and results in a optimal control problem. We analyse this problems and provide stability estimates for the controls as well as the unknown density in the presence of measurement errors. Our analytic findings are supported with numerical experiments.

math.OC↗

arXiv2019

A PDE model for bleb formation and interaction with linker proteins

The aim of this paper is to further develop mathematical models for bleb formation in cells, including cell-membrane interactions with linker proteins. This leads to nonlinear reaction-diffusion equations on a surface coupled to fluid dynamics in the bulk. We provide a detailed mathematical analysis and investigate some singular limits of the model, connecting it to previous literature. Moreover, we provide numerical simulations in different scenarios, confirming that the model can reproduce experimental results on bleb initation.

math.AP↗

arXiv2019

Total Variation Regularisation with Spatially Variable Lipschitz Constraints

We introduce a first order Total Variation type regulariser that decomposes a function into a part with a given Lipschitz constant (which is also allowed to vary spatially) and a jump part. The kernel of this regulariser contains all functions whose Lipschitz constant does not exceed a given value, hence by locally adjusting this value one can determine how much variation is the reconstruction allowed to have. We prove regularising properties of this functional, study its connections to other Total Variation type regularisers and propose a primal dual optimisation scheme. Our numerical experiments demonstrate that the proposed first order regulariser can achieve reconstruction quality similar to that of second order regularisers such as Total Generalised Variation, while requiring significantly less computational time.

math.NA↗

arXiv2019

Solution Paths of Variational Regularization Methods for Inverse Problems

We consider a family of variational regularization functionals for a generic inverse problem, where the data fidelity and regularization term are given by powers of a Hilbert norm and an absolutely one-homogeneous functional, respectively, and the regularization parameter is interpreted as artificial time. We investigate the small and large time behavior of the associated solution paths and, in particular, prove finite extinction time for a large class of functionals. Depending on the powers, we also show that the solution paths are of bounded variation or even Lipschitz continuous. In addition, it will turn out that the models are "almost" mutually equivalent in terms of the minimizers they admit. Finally, we apply our results to define and compare two different non-linear spectral representations of data and show that only one of it is able to decompose a linear combination of non-linear eigenfunctions into the individual eigenfunctions. For that purpose, we will also briefly address piecewise affine solution paths.

math.OC↗

arXiv2019

Variational Graph Methods for Efficient Point Cloud Sparsification

In recent years new application areas have emerged in which one aims to capture the geometry of objects by means of three-dimensional point clouds. Often the obtained data consist of a dense sampling of the object's surface, containing many redundant 3D points. These unnecessary data samples lead to high computational effort in subsequent processing steps. Thus, point cloud sparsification or compression is often applied as a preprocessing step. The two standard methods to compress dense 3D point clouds are random subsampling and approximation schemes based on hierarchical tree structures, e.g., octree representations. However, both approaches give little flexibility for adjusting point cloud compression based on a-priori knowledge on the geometry of the scanned object. Furthermore, these methods lead to suboptimal approximations if the 3D point cloud data is prone to noise. In this paper we propose a variational method defined on finite weighted graphs, which allows to sparsify a given 3D point cloud while giving the flexibility to control the appearance of the resulting approximation based on the chosen regularization functional. The main contribution in this paper is a novel coarse-to-fine optimization scheme for point cloud sparsification, inspired by the efficiency of the recently proposed Cut Pursuit algorithm for total variation denoising. This strategy gives a substantial speed up in computing sparse point clouds compared to a direct application on all points as done in previous works and renders variational methods now applicable for this task. We compare different settings for our point cloud sparsification method both on unperturbed as well as noisy 3D point cloud data.

math.NA↗

arXiv2019

Strong solutions and weak-strong stability in a system of cross-diffusion equations

Proving the uniqueness of solutions to multi-species cross-diffusion systems is a difficult task in the general case, and there exist very few results in this direction. In this work, we study a particular system with zero-flux boundary conditions for which the existence of a weak solution has been proven in [Ehrlacher2017]. Under additional assumptions on the value of the cross-diffusion coefficients, we are able to show the existence and uniqueness of strong solutions. The proof relies on the use of an appropriate approximation and a fixed-point argument. In addition, a weak-strong stability result is obtained for this system in dimension one.

math.AP↗

arXiv2019

An entropic Landweber method for linear ill-posed problems

The aim of this paper is to investigate the use of an entropic projection method for the iterative regularization of linear ill-posed problems. We derive a closed form solution for the iterates and analyze their convergence behaviour both in a case of reconstructing general nonnegative unknowns as well as for the sake of recovering probability distributions. Moreover, we discuss several variants of the algorithm and relations to other methods in the literature. The effectiveness of the approach is studied numerically in several examples.

math.OC↗

arXiv2019

Instantaneous control of interacting particle systems in the mean-field limit

Controlling large particle systems in collective dynamics by a few agents is a subject of high practical importance, e.g., in evacuation dynamics. In this paper we study an instantaneous control approach to steer an interacting particle system into a certain spatial region by repulsive forces from a few external agents, which might be interpreted as shepherd dogs leading sheep to their home. We introduce an appropriate mathematical model and the corresponding optimization problem. In particular, we are interested in the interaction of numerous particles, which can be approximated by a mean-field equation. Due to the high-dimensional phase space this will require a tailored optimization strategy. The arising control problems are solved using adjoint information to compute the descent directions. Numerical results on the microscopic and the macroscopic level indicate the convergence of optimal controls and optimal states in the mean-field limit,i.e., for an increasing number of particles.

math.OC↗

arXiv2019

A total variation based regularizer promoting piecewise-Lipschitz reconstructions

We introduce a new regularizer in the total variation family that promotes reconstructions with a given Lipschitz constant (which can also vary spatially). We prove regularizing properties of this functional and investigate its connections to total variation and infimal convolution type regularizers TVLp and, in particular, establish topological equivalence. Our numerical experiments show that the proposed regularizer can achieve similar performance as total generalized variation while having the advantage of a very intuitive interpretation of its free parameter, which is just a local estimate of the norm of the gradient. It also provides a natural approach to spatially adaptive regularization.

math.NA↗