Related papers: Numerical approximation of general Lipschitz BSDEs…

We present a unified convergence theory for gradient-based training of neural network methods for partial differential equations (PDEs), covering both physics-informed neural networks (PINNs) and the Deep Ritz method. For linear PDEs, we…

Subgradient methods comprise a fundamental class of nonsmooth optimization algorithms. Classical results show that certain subgradient methods converge sublinearly for general Lipschitz convex functions and converge linearly for convex…

We propose a descent subgradient algorithm for minimizing a real function, assumed to be locally Lipschitz, but not necessarily smooth or convex. To find an effective descent direction, the Goldstein subdifferential is approximated through…

We propose a new simple and explicit numerical scheme for time-homogeneous stochastic differential equations. The scheme is based on sampling increments at each time step from a skew-symmetric probability distribution, with the level of…

We propose and analyze a numerical algorithm for solving a class of optimal control problems for learning-informed semilinear partial differential equations. The latter is a class of PDEs with constituents that are in principle unknown and…

This paper delves into the well-posedness and the numerical approximation of non-autonomous stochastic differential algebraic equations (SDAEs) with nonlinear local Lipschitz coefficients that satisfy the more general monotonicity condition…

This study develops a numerical scheme for path-dependent FBSDEs and PDEs. We introduce a Picard iteration method for solving path-dependent FBSDEs, prove its convergence to the true solution, and establish its rate of convergence. A key…

We develop a fully discrete, semi-implicit mixed finite element method for approximating solutions to a class of fourth-order stochastic partial differential equations (SPDEs) with non-globally Lipschitz and non-monotone nonlinearities,…

Many problems in machine learning write as the minimization of a sum of individual loss functions over the training examples. These functions are usually differentiable but, in some cases, their gradients are not Lipschitz continuous, which…

We deal with the numerical solution of linear partial differential equations (PDEs) with focus on the goal-oriented error estimates including algebraic errors arising by an inaccurate solution of the corresponding algebraic systems. The…

The aim of this work is to consider multiscale algorithms for solving PDEs with Galerkin methods on bounded domains. We provide results on convergence and condition numbers. We show how to handle PDEs with Dirichlet boundary conditions. We…

Randomized smoothing is a widely adopted technique for optimizing nonsmooth objective functions. However, its efficiency analysis typically relies on global Lipschitz continuity, a condition rarely met in practical applications. To address…

In this article, we present a family of numerical approaches to solve high-dimensional linear non-symmetric problems. The principle of these methods is to approximate a function which depends on a large number of variates by a sum of tensor…

This paper is devoted to the study of the differentiability of solutions to real-valued backward stochastic differential equations (BSDEs for short) with quadratic generators driven by a cylindrical Wiener process. The main novelty of this…

The aim of this work is to study the numerical solution of the nonlinear Schrodinger problem using a combination between Witt basis and finite difference approximations. We construct a discrete fundamental solution for the non-stationary…

We present the Multilevel Bregman Proximal Gradient Descent (ML BPGD) method, a novel multilevel optimization framework tailored to constrained convex problems with relative Lipschitz smoothness. Our approach extends the classical…

We take advantage of recent and new results on optimal quantization theory to improve the quadratic optimal quantization error bounds for backward stochastic differential equations (BSDE) and nonlinear filtering problems. For both problems,…

Previous papers have shown the impact of partial convergence of discretized PDE on the accuracy of tangent and adjoint linearizations. A series of papers suggested linearization of the fixed point iteration used in the solution process as a…

A method of representation of a solution as segments of the series in powers of the step of the independent variable is expanded for solving complex systems of ordinary differential equations (ODE): the Lorenz system and other systems. A…

In this paper, we consider a class of structured nonconvex nonsmooth optimization problems, in which the objective function is formed by the sum of a possibly nonsmooth nonconvex function and a differentiable function whose gradient is…