Related papers: On the Solution of Stochastic Functional Different…
In this paper, the global optimization problem $\min_{y\in S} F(y)$ with $S$ being a hyperinterval in $\Re^N$ and $F(y)$ satisfying the Lipschitz condition with an unknown Lipschitz constant is considered. It is supposed that the function…
Sufficient and necessary conditions are presented for the order-preservation of stochastic functional differential equations on $\R^d$ with non-Lipschitzian coefficients driven by the Brownian motion and Poisson processes. The sufficiency…
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.…
We prove an $L^2$-regularity result for the solutions of Forward Backward Doubly Stochastic Differentiel Equations (FBDSDEs in short) under globally Lipschitz continuous assumptions on the coefficients. Therefore, we extend the well known…
In this paper the numerical approximation of solutions of Liouville-Master Equations for time-dependent distribution functions of Piecewise Deterministic Processes with memory is considered. These equations are linear hyperbolic PDEs with…
The limited memory steepest descent method (Fletcher, 2012) for unconstrained optimization problems stores a few past gradients to compute multiple stepsizes at once. We review this method and propose new variants. For strictly convex…
We consider high order approximations of the solution of the stochastic filtering problem, derive their pathwise representation in the spirit of the earlier work of Clark and Davis and prove their robustness property. In particular, we show…
This paper addresses the study of derivative-free smooth optimization problems, where the gradient information on the objective function is unavailable. Two novel general derivative-free methods are proposed and developed for minimizing…
We consider stochastic differential equations on $\mathbb R^d$ with coefficients depending on the path and distribution for the whole history. Under a local integrability condition on the time-spatial singular drift, the well-posedness and…
We prove that if $f:\mathbb{R}\to\mathbb{R}$ is Lipschitz continuous, then for every $H\in(0,1/4]$ there exists a probability space on which we can construct a fractional Brownian motion $X$ with Hurst parameter $H$, together with a process…
We consider stochastic variational inequality problems where the mapping is monotone over a compact convex set. We present two robust variants of stochastic extragradient algorithms for solving such problems. Of these, the first scheme…
We present a condition for a stochastic differential equation dX_{t}={\mu}(t,X_{t})dt+{\sigma}(t,X_{t})dB_{t} to have a unique functional solution of the form Z(t,B_{t}). The condition expresses a relation between {\mu} and {\sigma}. A…
This book is devoted to finite-dimensional problems of non-convex non-smooth optimization and numerical methods for their solution. The problem of nonconvexity is studied in the book on two main models of nonconvex dependencies: these are…
Motivated by problems arising in decentralized control problems and non-cooperative Nash games, we consider a class of strongly monotone Cartesian variational inequality (VI) problems, where the mappings either contain expectations or their…
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…
Under a local one-sided Lipschitz condition, Krylov [KR] proved the existence and uniqueness of the strong solutions for stochastic differential equations by using the Euler-Maruyama approximation, where he showed that the sequence of…
The problem of function approximation by neural dynamical systems has typically been approached in a top-down manner: Any continuous function can be approximated to an arbitrary accuracy by a sufficiently complex model with a given…
This paper is concerned with long-time strong approximations of SDEs with non-globally Lipschitz coefficients.Under certain non-globally Lipschitz conditions, a long-time version of fundamental strong convergence theorem is established for…
Block-coordinate algorithms are recognized to furnish efficient iterative schemes for addressing large-scale problems, especially when the computation of full derivatives entails substantial memory requirements and computational efforts. In…
We consider convex stochastic optimization problems under different assumptions on the properties of available stochastic subgradient. It is known that, if the value of the objective function is available, one can obtain, in parallel,…