Related papers: Weak Convergence Methods for Approximation of Path…
Stochastic gradient methods are the workhorse (algorithms) of large-scale optimization problems in machine learning, signal processing, and other computational sciences and engineering. This paper studies Markov chain gradient descent, a…
We consider a class of sampling-based decomposition methods to solve risk-averse multistage stochastic convex programs. We prove a formula for the computation of the cuts necessary to build the outer linearizations of the recourse…
We introduce a new extragradient iterative process, motivated and inspired by [S. H. Khan, A Picard-Mann Hybrid Iterative Process, Fixed Point Theory and Applications, doi:10.1186/1687-1812-2013-69], for finding a common element of the set…
In this paper we discuss weak convergence of continuous-time Markov chains to a non-symmetric pure jump process. We approach this problem using Dirichlet forms as well as semimartingales. As an application, we discuss how to approximate a…
The study of time-inhomogeneous Markov jump processes is a traditional topic within probability theory that has recently attracted substantial attention in various applications. However, their flexibility also incurs a substantial…
We introduce a notion of weak convergence in arbitrary metric spaces. Metric functionals are key in our analysis: weak convergence of sequences in a given metric space is tested against all the metric functionals defined on said space. When…
We consider stochastic variational inequalities with monotone operators defined as the expected value of a random operator. We assume the feasible set is the intersection of a large family of convex sets. We propose a method that combines…
The convergence of stochastic integrals driven by a sequence of Wiener processes $W_n\to W$ (with convergence in $C_t$) is crucial in the analysis of stochastic partial differential equations (SPDEs). The convergence we focus on in this…
We present a numerical method to compute expectations of functionals of a piecewise-deterministic Markov process. We discuss time dependent functionals as well as deterministic time horizon problems. Our approach is based on the…
The marked Hawkes risk process is a compound point process for which the occurrence and amplitude of past events impact the future. Thanks to its autoregressive properties, it found applications in various fields such as neuosciences,…
In this paper new analytical and numerical approaches to valuating path-dependent options of European type have been developed. The model of stochastic volatility as a basic model has been chosen. For European options we could improve the…
In this paper we consider convex optimization problems with stochastic composite objective function subject to (possibly) infinite intersection of constraints. The objective function is expressed in terms of expectation operator over a sum…
It is known from the monograph [1, Chapter 5] that the weak convergence analysis of numerical schemes for stochastic Maxwell equations is an unsolved problem. This paper aims to fill the gap by establishing the long-time weak convergence…
Main objects of the paper are stationary and weak KAM Hamilton-Jacobi equations on the finite-dimensional torus. The key idea of the paper is to replace the underlying calculus of variations problems with continuous time Markov decision…
We study a variation of vanilla stochastic gradient descent where the optimizer only has access to a Markovian sampling scheme. These schemes encompass applications that range from decentralized optimization with a random walker (token…
Calculus via regularizations and rough paths are two methods to approach stochastic integration and calculus close to pathwise calculus. The origin of rough paths theory is purely deterministic, calculus via regularization is based on…
We study the weak finite element method solving convection-diffusion equations. A weak finite element scheme is presented based on a spacial variational form. We established a weak embedding inequality that is very useful in the weak finite…
Our work is part of the close link between continuous-time dissipative dynamical systems and optimization algorithms, and more precisely here, in the stochastic setting. We aim to study stochastic convex minimization problems through the…
A stochastic incremental subgradient algorithm for the minimization of a sum of convex functions is introduced. The method sequentially uses partial subgradient information and the sequence of partial subgradients is determined by a general…
This paper focuses on finding approximate solutions to stochastic optimal control problems with control domains being not necessarily convex, where the state trajectory is subject to controlled stochastic differential equations. The…