Showing 71 - 80 of 326
This paper introduces a new class of numerical schemes for the pathwise approximation of solutions of stochastic differential equations (SDEs). The proposed family of strong predictor-corrector Euler methods are designed to handle scenario simulation of solutions of SDEs. It has the potential to...
Persistent link: https://www.econbiz.de/10005041725
The paper introduces an approach for the derivation of discrete time approximations for solutions of stochastic differential equations with time delay. The suggested approximations converge in a strong sense. Furthermore, explicit solutions for linear stochastic delay equations are given.
Persistent link: https://www.econbiz.de/10005041740
Persistent link: https://www.econbiz.de/10005184615
Motivated by weak convergence results in the paper of Takahashi & Yoshida (2005), we show strong convergence for an accelerated Euler–Maruyama scheme applied to perturbed stochastic differential equations. The Milstein scheme with the same acceleration is also discussed as an extended result....
Persistent link: https://www.econbiz.de/10010765572
Using an Euler discretization to simulate a mean-reverting CEV process gives rise to the problem that while the process itself is guaranteed to be nonnegative, the discretization is not. Although an exact and efficient simulation algorithm exists for this process, at present this is not the case...
Persistent link: https://www.econbiz.de/10008609637
Persistent link: https://www.econbiz.de/10009149824
The paper introduces an approach for the derivation of discrete time approximations for solutions of stochastic differential equations (SDEs) with time delay. The suggested approximations converge in a strong sense. Furthermore, explicit solutions for linear stochastic delay equations are given.
Persistent link: https://www.econbiz.de/10011050382
Persistent link: https://www.econbiz.de/10005395569
We propose two restricted memory level bundle-like algorithms for minimizing a convex function over a convex set. If the memory is restricted to one linearization of the objective function, then both algorithms are variations of the projected subgradient method. The first algorithm, proposed in...
Persistent link: https://www.econbiz.de/10010896451
In this work we study a proximal-like method for the problem of convex minimization in Hilbert spaces. Using the classical proximal mapping, we construct a new stable iterative procedure. The strong convergence of obtained sequences to the normal solution of the optimization problem is proved....
Persistent link: https://www.econbiz.de/10010759231