Related papers: A boosted second-order convex splitting algorithm …
In this paper, we study the splitting method based on alternating direction method of multipliers for support vector machine in reproducing kernel Hilbert space with lower semi-continuous loss function. If the loss function is lower…
Although the performance of popular optimization algorithms such as Douglas-Rachford splitting (DRS) and the ADMM is satisfactory in small and well-scaled problems, ill conditioning and problem size pose a severe obstacle to their reliable…
Higher-order tensor methods were recently proposed for minimizing smooth convex and nonconvex functions. Higher-order algorithms accelerate the convergence of the classical first-order methods thanks to the higher-order derivatives used in…
The Douglas-Rachford algorithm is a classical and powerful splitting method for minimizing the sum of two convex functions and, more generally, finding a zero of the sum of two maximally monotone operators. Although this algorithm is well…
This paper is concerned with mixed finite element method (FEM) for solving the two-dimensional, nonlinear fourth-order active fluid equations. By introducing an auxiliary variable $w=-\Delta u$, the original fourth problem is transformed…
The $p$-step backwards difference formula (BDF) for solving the system of ODEs can result in a kind of all-at-once linear systems, which are solved via the parallel-in-time preconditioned Krylov subspace solvers (see McDonald, Pestana, and…
In this paper, based on a generalized scalar auxiliary variable approach with relaxation (R-GSAV), we construct a class of high-order backward differentiation formula (BDF) schemes with variable time steps for the…
Operator split forcing schemes exploiting a symmetrization principle, i.e. Strang splitting, for cascaded lattice Boltzmann (LB) methods in two- and three-dimensions for fluid flows with impressed local forces are presented. Analogous…
This paper introduces a novel approach to compute the numerical fluxes at the cell boundaries for a cell-centered conservative numerical scheme. Explicit gradients used in deriving the reconstruction polynomials are replaced by high-order…
Accelerated gradient methods are the cornerstones of large-scale, data-driven optimization problems that arise naturally in machine learning and other fields concerning data analysis. We introduce a gradient-based optimization framework for…
In this paper, we attempt to compare two distinct branches of research on second-order optimization methods. The first one studies self-concordant functions and barriers, the main assumption being that the third derivative of the objective…
In this paper we construct a third order method for solving additively split autonomous stiff systems of ordinary differential equations. The constructed additive method is L-stable with respect to the implicit part and allows to use an…
This paper proposes a homogeneous second-order descent framework (HSODF) for nonconvex and convex optimization based on the generalized homogeneous model (GHM). In comparison to the Newton steps, the GHM can be solved by extremal symmetric…
We present in this paper construction and analysis of a block-centered finite difference method for the spatial discretization of the scalar auxiliary variable Crank-Nicolson scheme (SAV/CN-BCFD) for gradient flows, and show rigorously that…
Variational phase-field models of brittle fracture pose a local constrained minimization problem of a non-convex energy functional. In the discrete setting, the problem is most often solved by alternate minimization, exploiting the separate…
The phase retrieval problem is a fundamental problem in many fields, which is appealing for investigation. It is to recover the signal vector $\tilde{x}\in\mathbb{C}^d$ from a set of $N$ measurements $b_n=|f^*_n\tilde{x}|^2,\ n=1,\cdots,…
A fully discrete implicit scheme is proposed for the Swift-Hohenberg model, combining the third-order backward differentiation formula (BDF3) for the time discretization and the second-order finite difference scheme for the space…
We propose fully discrete, implicit-in-time finite-volume schemes for a general family of non-linear and non-local Fokker-Planck equations with a gradient-flow structure, usually known as aggregation-diffusion equations, in any dimension.…
We propose an enhanced zeroth-order stochastic Frank-Wolfe framework to address constrained finite-sum optimization problems, a structure prevalent in large-scale machine-learning applications. Our method introduces a novel double variance…
This study addresses the well-posedness of a hemivariational inequality derived from the convective Brinkman-Forchheimer extended Darcy (CBFeD) model in both two and three dimensions. The CBFeD model describes the behavior of incompressible…