相关论文: A tamed-adaptive Milstein scheme for stochastic di…
This paper focuses on the randomized Milstein scheme for approximating solutions to stochastic Volterra integral equations with weakly singular kernels, where the drift coefficients are non-differentiable. An essential component of the…
Our main objective in this paper is to develop a second-order stochastic numerical method which generalizes the well-known deterministic TR-BDF2 scheme. Since most stochastic techniques used for approximating the solution of a stochastic…
This paper introduces a randomized tamed Euler scheme tailored for L\'evy-driven stochastic differential equations (SDEs) with superlinear random coefficients and Carath\'eodory-type drift. Under assumptions that allow for time-irregular…
This paper develops an $\alpha$-parametrized framework for analyzing the strong convergence of the stochastic theta (ST) method for stochastic differential equations driven by time-changed L\'evy noise (TCSDEwLNs) with time-space-dependent…
We study pathwise approximation of strong solutions of scalar stochastic differential equations (SDEs) at a single time in the presence of discontinuities of the drift coefficient. Recently, it has been shown by M\"uller-Gronbach and…
We consider the long-time behavior of an explicit tamed Euler scheme applied to a class of stochastic differential equations driven by additive noise, under a one-sided Lipschitz continuity condition. The setting encompasses drift…
For finite-dimensional problems, stochastic approximation methods have long been used to solve stochastic optimization problems. Their application to infinite-dimensional problems is less understood, particularly for nonconvex objectives.…
In this article, we propose an implicit finite difference scheme for a two-dimensional parabolic stochastic partial differential equation (SPDE) of Zakai type. The scheme is based on a Milstein approximation to the stochastic integral and…
We are investigating the first strong convergence analysis of a numerical method for stochastic differential algebraic equations (SDAEs) under a non-global Lipschitz setting. It is well known that the explicit Euler scheme fails to converge…
A class of implicit Milstein type methods is introduced and analyzed in the present article for stochastic differential equations (SDEs) with non-globally Lipschitz drift and diffusion coefficients. By incorporating a pair of method…
This work provides the first finite-time convergence guarantees for linearly constrained stochastic bilevel optimization using only first-order methods, requiring solely gradient information without any Hessian computations or second-order…
In this paper, we prove convergence for contractive time discretisation schemes for semi-linear stochastic evolution equations with irregular Lipschitz nonlinearities, initial values, and additive or multiplicative Gaussian noise on…
We propose a time-adaptive, high-order compact finite difference scheme for option pricing in a family of stochastic volatility models. We employ a semi-discrete high-order compact finite difference method for the spatial discretisation,…
We construct a higher-order adaptive method for strong approximations of exit times of It\^o stochastic differential equations (SDE). The method employs a strong It\^o--Taylor scheme for simulating SDE paths, and adaptively decreases the…
We here adapt an extended version of the adaptive cubic regularisation method with dynamic inexact Hessian information for nonconvex optimisation in [3] to the stochastic optimisation setting. While exact function evaluations are still…
Numerical analysis for the stochastic Stokes equations is still challenging even though it has been well done for the corresponding deterministic equations. In particular, the pre-existing error estimates of finite element methods for the…
In this article, we study the numerical approximation of stochastic differential equations driven by a multidimensional fractional Brownian motion (fBm) with Hurst parameter greater than 1/3. We introduce an implementable scheme for these…
Previous studies on stochastic primal-dual algorithms for solving min-max problems with faster convergence heavily rely on the bilinear structure of the problem, which restricts their applicability to a narrowed range of problems. The main…
This work considers the question: what convergence guarantees does the stochastic subgradient method have in the absence of smoothness and convexity? We prove that the stochastic subgradient method, on any semialgebraic locally Lipschitz…
Stochastic alternating algorithms for bi-objective optimization are considered when optimizing two conflicting functions for which optimization steps have to be applied separately for each function. Such algorithms consist of applying a…