Related papers: A boosted second-order convex splitting algorithm …
The alternating direction method of multipliers (ADMM) is a widely used method for solving many convex minimization models arising in signal and image processing. In this paper, we propose an inertial ADMM for solving a two-block separable…
As a counterpoint to recent numerical methods for crystal surface evolution, which agree well with microscopic dynamics but suffer from significant stiffness that prevents simulation on fine spatial grids, we develop a new numerical method…
In this paper, we consider nonconvex decentralised optimisation and learning over a network of distributed agents. We develop an ADMM algorithm based on the Randomised Block Coordinate Douglas-Rachford splitting method which enables agents…
A class of monotone operator equations, which can be decomposed into sum of the gradient of a strongly convex function and a linear and skew-symmetric operator, is considered in this work. Based on discretization of the generalized gradient…
An accelerated boundary integral method for Stokes flow of a suspension of deformable particles is presented for an arbitrary domain and implemented for the important case of a planar slit geometry. The computational complexity of the…
We introduce a time discretization for Wasserstein gradient flows based on the classical Backward Differentiation Formula of order two. The main building block of the scheme is the notion of geodesic extrapolation in the Wasserstein space,…
We propose a novel, highly efficient, mean-reverting-SAV-BDF2-based, long-time unconditionally stable numerical scheme for a class of finite-dimensional nonlinear models important in geophysical fluid dynamics. The scheme is highly…
We present and analyze a new second-order finite difference scheme for the Macromolecular Microsphere Composite hydrogel, Time-Dependent Ginzburg-Landau (MMC-TDGL) equation, a Cahn-Hilliard equation with Flory-Huggins-deGennes energy…
This paper aims to develop distributed algorithms for nonconvex optimization problems with complicated constraints associated with a network. The network can be a physical one, such as an electric power network, where the constraints are…
High-order time-stepping schemes are crucial for simulating incompressible fluid flows due to their ability to capture complex turbulent behavior and unsteady motion. In this work, we propose a third-order accurate numerical scheme for the…
We propose two numerical algorithms in the fully nonconvex setting for the minimization of the sum of a smooth function and the composition of a nonsmooth function with a linear operator. The iterative schemes are formulated in the spirit…
Calculating cost-effective solutions to particle dynamics in viscous flows is an important problem in many areas of industry and nature. We implement a second-order symmetric splitting method on the governing equations for a rigid…
The Boosted Difference of Convex functions Algorithm (BDCA) was recently proposed for minimizing smooth difference of convex (DC) functions. BDCA accelerates the convergence of the classical Difference of Convex functions Algorithm (DCA)…
We propose and study two second-order in time implicit-explicit (IMEX) methods for the coupled Stokes-Darcy system that governs flows in karst aquifers. The first is a combination of a second-order backward differentiation formula and the…
Reductions of the self-consistent mean field theory model of amphiphilic molecules in solvent can lead to a singular family of functionalized Cahn-Hilliard energies. We modify these energies, mollifying the singularities to stabilize the…
The aim of this paper is to study the time stepping scheme for approximately solving the subdiffusion equation with a weakly singular source term. In this case, many popular time stepping schemes, including the correction of high-order BDF…
Among numerical methods for partial differential equations arising from steepest descent dynamics of energy functionals (e.g., Allen-Cahn and Cahn-Hilliard equations), the convex splitting method is well-known to maintain unconditional…
We address the solution of time-varying optimization problems characterized by the sum of a time-varying strongly convex function and a time-invariant nonsmooth convex function. We design an online algorithmic framework based on…
In recent years, a distributed Douglas-Rachford splitting method (DDRSM) has been proposed to tackle multi-block separable convex optimization problems. This algorithm offers relatively easier subproblems and greater efficiency for…
We consider a variable metric linesearch based proximal gradient method for the minimization of the sum of a smooth, possibly nonconvex function plus a convex, possibly nonsmooth term. We prove convergence of this iterative algorithm to a…