Related papers: Stochastic convergence of regularized solutions an…
Regularization is a long-standing challenge for ill-posed linear inverse problems, and a prototype is the Fredholm integral equation of the first kind with additive Gaussian measurement noise. We introduce a new RKHS regularization adaptive…
We consider the problem of localizing the source using range and range-difference measurements. Both the problems are non-convex and non-smooth and are challenging to solve. In this paper, we develop an iterative algorithm - Source…
Our work focuses on stochastic gradient methods for optimizing a smooth non-convex loss function with a non-smooth non-convex regularizer. Research on this class of problem is quite limited, and until recently no non-asymptotic convergence…
We consider the problem of clustering in the presence of noise. That is, when on top of cluster structure, the data also contains a subset of \emph{unstructured} points. Our goal is to detect the clusters despite the presence of many…
We look at continuum solutions in optimisation problems associated to linear inverse problems $y = Ax$ with non-negativity constraint $x \geq 0$. We focus on the case where the noise model leads to maximum likelihood estimation through…
$L^2$ norm error estimates of semi- and full discretisations, using bulk--surface finite elements and Runge--Kutta methods, of wave equations with dynamic boundary conditions are studied. The analysis resides on an abstract formulation and…
In this paper we propose a new method to stabilise non-symmetric indefinite problems. The idea is to solve a forward and an adjoint problem simultaneously using a suitable stabilised finite element method. Both stabilisation of the element…
This paper is concerned with stochastic incompressible Navier-Stokes equations with multiplicative noise in two dimensions with respect to periodic boundary conditions. Based on the Helmholtz decomposition of the multiplicative noise,…
Poisson distributed measurements in inverse problems often stem from Poisson point processes that are observed through discretized or finite-resolution detectors, one of the most prominent examples being positron emission tomography (PET).…
In this paper, we study adaptive finite element approximations in a perturbation framework, which makes use of the existing adaptive finite element analysis of a linear symmetric elliptic problem. We prove the convergence and complexity of…
These lecture notes summarize various summer schools that I have given on the topic of solving inverse problems (state and parameter estimation) by combining optimally measurement observations and parametrized PDE models. After defining a…
A fully stochastic second-order adaptive-regularization method for unconstrained nonconvex optimization is presented which never computes the objective-function value, but yet achieves the optimal $\mathcal{O}(\epsilon^{-3/2})$ complexity…
To capture and simulate geometric surface evolutions, one effective approach is based on the phase field methods. Among them, it is important to design and analyze numerical approximations whose error bound depends on the inverse of the…
This paper is devoted to the error analysis of a time-spectral algorithm for fractional diffusion problems of order $\alpha$ ($0 < \alpha < 1$). The solution regularity in the Sobolev space is revisited, and new regularity results in the…
We consider an elliptic partial differential equation with a random diffusion parameter discretized by a stochastic collocation method in the parameter domain and a finite element method in the spatial domain. We prove convergence of an…
The entropy-based moment method is a well-known discretization for the velocity variable in kinetic equations which has many desirable theoretical properties but is difficult to implement with high-order numerical methods. The regularized…
The numerical properties of algorithms for finding the intersection of sets depend to some extent on the regularity of the sets, but even more importantly on the regularity of the intersection. The alternating projection algorithm of von…
Standard regularization methods that are used to compute solutions to ill-posed inverse problems require knowledge of the forward model. In many real-life applications, the forward model is not known, but training data is readily available.…
Motivated by value function estimation in reinforcement learning, we study statistical linear inverse problems, i.e., problems where the coefficients of a linear system to be solved are observed in noise. We consider penalized estimators,…
Strong approximation errors of both finite element semi-discretization and spatio-temporal full discretization are analyzed for the stochastic Allen-Cahn equation driven by additive noise in space dimension $d \leq 3$. The full…