Related papers: A first-order computational algorithm for reaction…
We introduce the Optimizing a Discrete Loss (ODIL) framework for the numerical solution of Partial Differential Equations (PDE) using machine learning tools. The framework formulates numerical methods as a minimization of discrete residuals…
First-order methods for minimization and saddle point (min-max) problems are widely used for solving large-scale problems, in particular arising in machine learning. The majority of works obtain favorable complexity guarantees of such…
We propose a numerical method for convection-diffusion problems under low regularity assumptions. We derive the method and analyze it using the primal-dual weak Galerkin (PDWG) finite element framework. The Euler-Lagrange formulation…
In this paper, we propose an efficient and flexible algorithm to solve dynamic mean-field planning problems based on an accelerated proximal gradient method. Besides an easy-to-implement gradient descent step in this algorithm, a crucial…
In this work, we revisit a classical incremental implementation of the primal-descent dual-ascent gradient method used for the solution of equality constrained optimization problems. We provide a short proof that establishes the linear…
Primal-dual splitting schemes are a class of powerful algorithms that solve complicated monotone inclusions and convex optimization problems that are built from many simpler pieces. They decompose problems that are built from sums, linear…
We introduce an efficient first-order primal-dual method for the solution of nonsmooth PDE-constrained optimization problems. We achieve this efficiency through not solving the PDE or its linearisation on each iteration of the optimization…
Coupled nonlinear system of reaction-diffusion equations describing multi-component (species) interactions with heterogeneous coefficients is considered. Finite volume method based approximation for the space is used to construct…
The least absolute shrinkage and selection operator (Lasso) is widely recognized across various fields of mathematics and engineering. Its variant, the generalized Lasso, finds extensive application in the fields of statistics, machine…
Primal-dual methods for solving convex optimization problems with functional constraints often exhibit a distinct two-stage behavior. Initially, they converge towards a solution at a sublinear rate. Then, after a certain point, the method…
A detailed description and validation of a recently developed integration scheme is here reported for one- and two-dimensional reaction-diffusion models. As paradigmatic examples of this class of partial differential equations the complex…
A DualTPD method is proposed for solving nonlinear partial differential equations. The method is characterized by three main features. First, decoupling via Fenchel--Rockafellar duality is achieved, so that nonlinear terms are discretized…
The use of implicit time-stepping schemes for the numerical approximation of solutions to stiff nonlinear time-evolution equations brings well-known advantages including, typically, better stability behaviour and corresponding support of…
Regularized empirical risk minimization problem with linear predictor appears frequently in machine learning. In this paper, we propose a new stochastic primal-dual method to solve this class of problems. Different from existing methods,…
This paper focuses on a nonlinear convection-diffusion equation with space and time-fractional Laplacian operators of orders $1<\beta<2$ and $0<\alpha\leq1$, respectively. We develop local discontinuous Galerkin methods, including Legendre…
Systems of reaction-diffusion equations are commonly used in biological models of food chains. The populations and their complicated interactions present numerous challenges in theory and in numerical approximation. In particular,…
A fast two-level linearized scheme with unequal time-steps is constructed and analyzed for an initial-boundary-value problem of semilinear subdiffusion equations. The two-level fast L1 formula of the Caputo derivative is derived based on…
Residual minimization is a widely used technique for solving Partial Differential Equations in variational form. It minimizes the dual norm of the residual, which naturally yields a saddle-point (min-max) problem over the so-called trial…
We introduce a novel explicit and stable numerical algorithm to solve the spatially discretized heat or diffusion equation. We compare the performance of the new method with analytical and numerical solutions. We show that the method is…
We propose a new, unified approach to solving jump-diffusion partial integro-differential equations (PIDEs) that often appear in mathematical finance. Our method consists of the following steps. First, a second-order operator splitting on…