Related papers: Convex ordering for stochastic Volterra equations …
A general class of nonconvex optimization problems is considered, where the penalty is the composition of a linear operator with a nonsmooth nonconvex mapping, which is concave on the positive real line. The necessary optimality condition…
In this paper, we propose new sequential randomized algorithms for convex optimization problems in the presence of uncertainty. A rigorous analysis of the theoretical properties of the solutions obtained by these algorithms, for full…
Comparison principles for Volterra equations play a role analogous to maximum principles in PDEs: they provide positivity and stability information on the solution and allow one to control the output of bounded inputs. In the continuous…
We propose several new nonsmooth Newton methods for solving convex composite optimization problems with polyhedral regularizers, while avoiding the computation of complicated second-order information on these functions. Under the…
We study the convergence of higher order schemes for the Cauchy problem associated to the KdV equation. More precisely, we design a Galerkin type implicit scheme which has higher order accuracy in space and first order accuracy in time. The…
Convex optimization problems arising in applications often have favorable objective functions and complicated constraints, thereby precluding first-order methods from being immediately applicable. We describe an approach that exchanges the…
We consider a class of stochastic gradient optimization schemes. Assuming that the objective function is strongly convex, we prove weak error estimates which are uniform in time for the error between the solution of the numerical scheme,…
We propose a general analytical framework for single-facility continuous location problems under spatial demand uncertainty. In contrast to classical formulations based on discrete or regionally aggregated demands, the proposed model…
Successive quadratic approximations, or second-order proximal methods, are useful for minimizing functions that are a sum of a smooth part and a convex, possibly nonsmooth part that promotes regularization. Most analyses of iteration…
This article is devoted to the analysis of semilinear, parabolic, Stochastic Partial Differential Equations, with slow and fast time scales. Asymptotically, an averaging principle holds: the slow component converges to the solution of…
We consider convex-concave saddle-point problems where the objective functions may be split in many components, and extend recent stochastic variance reduction methods (such as SVRG or SAGA) to provide the first large-scale linearly…
The numerical method for solution of the weakly regular scalar Volterra integral equation of the 1st kind is proposed. The kernels of such equations have jump discontinuities on the continuous curves which starts at the origin. The…
This paper develops methods for numerically solving stochastic delay-differential equations (SDDEs) with multiple fixed delays that do not align with a uniform time mesh. We focus on numerical schemes of strong convergence orders $1/2$ and…
In this two-part paper, we propose a general algorithmic framework for the minimization of a nonconvex smooth function subject to nonconvex smooth constraints. The algorithm solves a sequence of (separable) strongly convex problems and…
For backward stochastic Volterra integral equations (BSVIEs) in multi-dimensional Euclidean spaces, comparison theorems are established in a systematic way for the adapted solutions and adapted M-solutions. For completeness, comparison…
We propose a novel class of tempo-spatial Ornstein-Uhlenbeck processes as solutions to L\'evy-driven Volterra equations with additive noise and multiplicative drift. After formulating conditions for the existence and uniqueness of…
We introduce a class of explicit balanced schemes for stochastic differential equations with coefficients of superlinearly growth satisfying a global monotone condition. The first scheme is a balanced Euler scheme and is of order half in…
In this paper, we introduce various mechanisms to obtain accelerated first-order stochastic optimization algorithms when the objective function is convex or strongly convex. Specifically, we extend the Catalyst approach originally designed…
Focusing on identification, this paper develops a class of convex optimization-based criteria and correspondingly the recursive algorithms to estimate the parameter vector $\theta^{*}$ of a stochastic dynamic system. Not only do the…
We propose a first-order method for stochastic strongly convex optimization that attains $O(1/n)$ rate of convergence, analysis show that the proposed method is simple, easily to implement, and in worst case, asymptotically four times…