Related papers: Discretization Error of Stochastic Iterated Integr…
This paper is concerned with the adaptive numerical treatment of stochastic partial differential equations. Our method of choice is Rothe's method. We use the implicit Euler scheme for the time discretization. Consequently, in each step, an…
In this paper we study the path-regularity and martingale properties of the set-valued stochastic integrals defined in our previous work Ararat et al. (2023). Such integrals have some fundamental differences from the well-known…
In this paper, we propose a stochastic Primal-Dual Hybrid Gradient (PDHG) approach for solving a wide spectrum of regularized stochastic minimization problems, where the regularization term is composite with a linear function. It has been…
We present a hybrid a-priori/a-posteriori goal oriented error estimator for a combination of dynamic iteration-based solution of ordinary differential equations discretized by finite elements. Our novel error estimator combines estimates…
We present a Markov-chain analysis of blockwise-stochastic algorithms for solving partially block-separable optimization problems. Our main contributions to the extensive literature on these methods are statements about the Markov operators…
The Inverse Problem for the estimation of a point-wise approximation error occurring at the discretization and solving of the system of partial differential equations is addressed. The set of the differences between the numerical solutions…
In the past several years, the last-iterate convergence of the Stochastic Gradient Descent (SGD) algorithm has triggered people's interest due to its good performance in practice but lack of theoretical understanding. For Lipschitz convex…
We investigate the convergence properties of a stochastic primal-dual splitting algorithm for solving structured monotone inclusions involving the sum of a cocoercive operator and a composite monotone operator. The proposed method is the…
We consider the numerical approximation of general semilinear parabolic stochastic partial differential equations (SPDEs) driven by additive space-time noise. In contrast to the standard time stepping methods which uses basic increments of…
The article is devoted to the mean-square approximation of iterated Ito and Stratonovich stochastic integrals in the context of the numerical integration of Ito stochastic differential equations. The expansion of iterated Ito stochastic…
In this paper we study the asymptotic behavior of stochastic approximation schemes with set-valued drift function and non-additive iterate-dependent Markov noise. We show that a linearly interpolated trajectory of such a recursion is an…
In computational system biology, the mesoscopic model of reaction-diffusion kinetics is described by a continuous time, discrete space Markov process. To simulate diffusion stochastically, the jump coefficients are obtained by a…
In this paper, a higher-order time-discretization scheme is proposed, where the iterates approximate the solution of the stochastic semilinear wave equation driven by multiplicative noise with general drift and diffusion. We employ a…
The challenging problem of conducting fully Bayesian inference for the reaction rate constants governing stochastic kinetic models (SKMs) is considered. Given the challenges underlying this problem, the Markov jump process representation is…
In this paper, we consider a numerical approximation of the stochastic differential equation (SDE) $$X_{t}=x_{0}+ \int_{0}^{t} b(s, X_{s}) \mathrm{d}s + L_{t},~x_{0} \in \mathbb{R}^{d},~t \in [0,T],$$ where the drift coefficient $b:[0,T]…
Weak approximations have been developed to calculate the expectation value of functionals of stochastic differential equations, and various numerical discretization schemes (Euler, Milshtein) have been studied by many authors. We present a…
We study a stochastic optimization problem in which the sampling distribution depends on the decision variable, and the available samples are generated through an iterate-dependent Markov chain. Such settings arise naturally in problems…
Under mild assumptions stochastic gradient methods asymptotically achieve an optimal rate of convergence if the arithmetic mean of all iterates is returned as an approximate optimal solution. However, in the absence of stochastic noise, the…
We study deterministic and stochastic primal-dual sub-gradient algorithms for distributed optimization of a separable objective function with global inequality constraints. In both algorithms, the norm of the Lagrangian multipliers are…
We consider numerical approximations of stochastic differential equations by the Euler method. In the case where the SDE is elliptic or hypoelliptic, we show a weak backward error analysis result in the sense that the generator associated…