Related papers: A closed-measure approach to stochastic approximat…
Our main result is to prove almost-sure convergence of a stochastic-approximation algorithm defined on the space of measures on a non-compact space. Our motivation is to apply this result to measure-valued P\'olya processes (MVPPs, also…
We develop a new framework for deriving time-uniform concentration bounds for the output of stochastic sequential algorithms satisfying certain recursive inequalities akin to those defining the almost-supermartingale processes introduced by…
We formulate, and present a numerical method for solving, an inverse problem for inferring parameters of a deterministic model from stochastic observational data (quantities of interest). The solution, given as a probability measure, is…
We prove the convergence of an incremental projection numerical scheme for the time-dependent incompressible Navier--Stokes equations, without any regularity assumption on the weak solution. The velocity and the pressure are discretised in…
The CEV model is given by the stochastic differential equation $X_t=X_0+\int_0^t\mu X_sds+\int_0^t\sigma (X^+_s)^pdW_s$, $\frac{1}{2}\le p<1$. It features a non-Lipschitz diffusion coefficient and gets absorbed at zero with a positive…
This paper proposes an adaptive time-stepping mothods for stochastic diffusion systems whose drift and diffusion coefficients are locally Lipschitz continuous and may exhibit polynomial growth. By controlling the growth of both the drift…
We propose a new concept of (S)-convergence applicable to numerical methods as well as other consistent approximations of the Euler system in gas dynamics. (S)-convergence, based on averaging in the spirit of Strong Law of Large Numbers,…
This paper studies limit measures of stationary measures of stochastic ordinary differential equations on the Euclidean space and tries to determine which invariant measures of an unperturbed system will survive. Under the assumption for…
In this paper we consider a stochastic heavy-ball method for solving linear ill-posed inverse problems. With suitable choices of the step-sizes and the momentum coefficients, we establish the regularization property of the method under {\it…
This paper presents a numerical approximation technique for the Boltzmann equation based on a moment system approximation in velocity dependence and a discontinuous Galerkin finite-element approximation in position dependence. The closure…
We propose and analyze a finite element method for a semi-stationary Stokes system modeling compressible fluid flow subject to a Navier-slip boundary condition. The velocity (momentum) equation is approximated by a mixed finite element…
We define a stochastic variant of the proximal point algorithm in the general setting of nonlinear (separable) Hadamard spaces for approximating zeros of the mean of a stochastically perturbed monotone vector field and prove its convergence…
In this paper, we survey physically related applications of a class of weighted quasi-Monte Carlo methods from a theoretical, deterministic perspective, and establish quantitative universal rapid convergence results via various regularity…
This paper introduces two novel nonlinear stochastic attitude estimators developed on the Special Orthogonal Group \mathbb{SO}\left(3\right) with the tracking error of the normalized Euclidean distance meeting predefined transient and…
This work introduces a sampling method capable of solving Bayesian inverse problems in function space. It does not assume the log-concavity of the likelihood, meaning that it is compatible with nonlinear inverse problems. The method…
Majorization-minimization schemes are a broad class of iterative methods targeting general optimization problems, including nonconvex, nonsmooth and stochastic. These algorithms minimize successively a sequence of upper bounds of the…
We consider the composite minimization problem with the objective function being the sum of a continuously differentiable and a merely lower semicontinuous and extended-valued function. The proximal gradient method is probably the most…
This paper presents an extension of stochastic gradient descent for the minimization of Lipschitz continuous loss functions. Our motivation is for use in non-smooth non-convex stochastic optimization problems, which are frequently…
An important mathematical tool in the analysis of dynamical systems is the approximation of the reach set, i.e., the set of states reachable after a given time from a given initial state. This set is difficult to compute for complex systems…
We develop a short-step interior point method to optimize a linear function over a convex body assuming that one only knows a membership oracle for this body. The approach is based on Abernethy and Hazan's sketch of a universal interior…