Related papers: Monotone discretizations of levelset convex geomet…

This paper deals with the Hessian discretisation method (HDM) for fourth order semi-linear elliptic equations with a trilinear nonlinearity. The HDM provides a generic framework for the convergence analysis of several numerical methods,…

We study the convergence of the new family of mimetic finite difference schemes for linear diffusion problems recently proposed in [38]. In contrast to the conventional approach, the diffusion coefficient enters both the primary mimetic…

Solutions of certain partial differential equations (PDEs) are often represented by the steepest descent curves of corresponding functionals. Minimizing movement scheme was developed in order to study such curves in metric spaces.…

We consider minimization of a smooth nonconvex objective function using an iterative algorithm based on Newton's method and the linear conjugate gradient algorithm, with explicit detection and use of negative curvature directions for the…

In this paper, we present an efficient numerical algorithm for solving the time-dependent Cahn--Hilliard--Navier--Stokes equations that model the flow of two phases with different densities. The pressure-correction step in the projection…

Models incorporating uncertain inputs, such as random forces or material parameters, have been of increasing interest in PDE-constrained optimization. In this paper, we focus on the efficient numerical minimization of a convex and smooth…

We develop a new computational framework to solve the partial differential equations (PDEs) governing the flow of the joint probability density functions (PDFs) in continuous-time stochastic nonlinear systems. The need for computing the…

The article is devoted to the development of algorithmic methods ensuring efficient complexity bounds for strongly convex-concave saddle point problems in the case when one of the groups of variables is high-dimensional, and the other is…

Variational inequalities represent a broad class of problems, including minimization and min-max problems, commonly found in machine learning. Existing second-order and high-order methods for variational inequalities require precise…

We present a discretization-free scalable framework for solving a large class of mass-conserving partial differential equations (PDEs), including the time-dependent Fokker-Planck equation and the Wasserstein gradient flow. The main…

In this article we study a finite horizon optimal control problem with monotone controls. We consider the associated Hamilton-Jacobi-Bellman (HJB) equation which characterizes the value function. We consider the totally discretized problem…

In this paper, we propose a monotone mixed finite difference scheme for solving the two-dimensional Monge-Amp\`ere equation. In order to accomplish this, we convert the Monge-Amp\`ere equation to an equivalent Hamilton-Jacobi-Bellman (HJB)…

We investigate rates of convergence for two approximation schemes of time-independent and time-dependent Hamilton-Jacobi equ-ations with Kirchoff junction conditions. We analyze the vanishing viscosity limit and monotone finite-difference…

This paper proposes a parallel numerical algorithm to simulate the flow and the transport in a discrete fracture network taking into account the mass exchanges with the surrounding matrix. The discretization of the Darcy fluxes is based on…

We study the convergence in total variation and $V$-norm of discretization schemes of the underdamped Langevin dynamics. Such algorithms are very popular and commonly used in molecular dynamics and computational statistics to…

This article details a novel numerical scheme to approximate gradient flows for optimal transport (i.e. Wasserstein) metrics. These flows have proved useful to tackle theoretically and numerically non-linear diffusion equations that model…

We prove optimal convergence rates for the discretization of a general second-order linear elliptic PDE with an adaptive vertex-centered finite volume scheme. While our prior work Erath and Praetorius [SIAM J. Numer. Anal., 54 (2016), pp.…

In monotone submodular function maximization, approximation guarantees based on the curvature of the objective function have been extensively studied in the literature. However, the notion of curvature is often pessimistic, and we rarely…

We present stochastic homogenization results for viscous Hamilton-Jacobi equations using a new argument which is based only on the subadditive structure of maximal subsolutions (solutions of the "metric problem"). This permits us to give…

This paper proposes the Doubly Compressed Momentum-assisted stochastic gradient tracking algorithm $\texttt{DoCoM}$ for communication-efficient decentralized optimization. The algorithm features two main ingredients to achieve a…