Related papers: Convergence rate in the splitting-up method for ro…
We propose a new numerical method for $\alpha$-dissipative solutions of the Hunter-Saxton equation, where $\alpha$ belongs to $W^{1, \infty}(\mathbb{R}, [0, 1))$. The method combines a projection operator with a generalized method of…
This paper establishes the existence and uniqueness of solutions for rough differential equations driven by reduced rough paths with low regularity, specifically in the roughness regime $\frac{1}{3} < \alpha \leq \frac{1}{2}$. While the…
We consider the rough differential equations driven by tempered fractional Brownian motion with Hurst index $H\in (\frac{1}{4}, \frac{1}{3})$ and tempered parameter $\lambda>0$. First, by means of piecewise linear approximation, we…
Averaging scheme has attracted extensive attention in deep learning as well as traditional machine learning. It achieves theoretically optimal convergence and also improves the empirical model performance. However, there is still a lack of…
This paper provides a self-contained ordinary differential equation solver approach for separable convex optimization problems. A novel primal-dual dynamical system with built-in time rescaling factors is introduced, and the exponential…
We consider a difference-of-convex formulation where one of the terms is allowed to be hypoconvex (or weakly convex). We first examine the precise behavior of a single iteration of the Difference-of-Convex algorithm (DCA), giving a tight…
Large-scale optimization problems require algorithms both effective and efficient. One such popular and proven algorithm is Stochastic Gradient Descent which uses first-order gradient information to solve these problems. This paper studies…
In the following document, we present a way to obtain the order of convergence of the Fractional Newton-Raphson (F N-R) method, which seems to have an order of convergence at least linearly for the case in which the order $\alpha$ of the…
We develop a high order reconstructed discontinuous approximation (RDA) method for solving a mixed formulation of the quad-curl problem in two and three dimensions. This mixed formulation is established by adding an auxiliary variable to…
The numerical solution methods for partial differential equation (PDE) solution allow obtaining a discrete field that converges towards the solution if the method is applied to the correct problem. Nevertheless, the numerical methods…
Construction of splitting-step methods and properties of related non-negativity and boundary preserving numerical algorithms for solving stochastic differential equations (SDEs) of Ito-type are discussed. We present convergence proofs for a…
L\'evy's Upward Theorem says that the conditional expectation of an integrable random variable converges with probability one to its true value with increasing information. In this paper, we use methods from effective probability theory to…
Since the breakthrough in rough paths theory for stochastic ordinary differential equations (SDEs), there has been a strong interest in investigating the rough differential equation (RDE) approach and its numerous applications. Rough path…
We adapt the Douglas-Rachford (DR) splitting method to solve nonconvex feasibility problems by studying this method for a class of nonconvex optimization problem. While the convergence properties of the method for convex problems have been…
We study controlled differential equations driven by a rough path (in the sense of T. Lyons) with an additional, possibly unbounded drift term. We show that the equation induces a solution flow if the drift grows at most linearly.…
We establish the existence of solutions to path-dependent rough differential equations with non-anticipative coefficients. Regularity assumptions on the coefficients are formulated in terms of horizontal and vertical derivatives.
We examine convergence properties of continuous-time variants of accelerated Forward-Backward (FB) and Douglas-Rachford (DR) splitting algorithms for nonsmooth composite optimization problems. When the objective function is given by the sum…
We establish new theoretical convergence guarantees for the difference-of-convex algorithm (DCA), where the second function is allowed to be weakly-convex, measuring progress via composite gradient mapping. Based on a tight analysis of two…
The difference-of-convex (DC) program is an important model in nonconvex optimization due to its structure, which encompasses a wide range of practical applications. In this paper, we aim to tackle a generalized class of DC programs, where…
Simulation of rough volatility models involves discretization of stochastic integrals where the integrand is a function of a (correlated) fractional Brownian motion of Hurst index $H \in (0,1/2)$. We obtain results on the rate of…