Related papers: Convergence analysis for minimum action methods co…
Momentum methods have been shown to accelerate the convergence of the standard gradient descent algorithm in practice and theory. In particular, the minibatch-based gradient descent methods with momentum (MGDM) are widely used to solve…
We study finite-sum non-convex optimization $\min_{x\in\mathbb{R}^d} F(x) \;=\; \frac{1}{n}\sum_{i=1}^n f_i(x)$ and analyze a variance-reduced cubic Newton method based on EMA-smoothed SARAH estimators for both gradient and Hessian…
This paper derives a free analog of the Euler-Maruyama method (fEMM) to numerically approximate solutions of free stochastic differential equations (fSDEs). Simply speaking fSDEs are stochastic differential equations in the context of…
We consider the numerical approximation of a general second order semi--linear parabolic stochastic partial differential equation (SPDEs) driven by space-time noise, for multiplicative and additive noise. We examine convergence of…
We investigate a fully discrete finite element approximation for the stochastic Kuramoto-Sivashinsky equation, combining the standard finite element methods in spatial discretization with the implicit Euler-Maruyama scheme in time. Rigorous…
In this paper, we investigate the stochastic evolution equations (SEEs) driven by $\log$-Whittle-Mat$\acute{{\mathrm{e}}}$rn (W-M) random diffusion coefficient field and $Q$-Wiener multiplicative force noise. First, the well-posedness of…
This paper presents novel refinement sensors for the application to adaptive mesh and algorithm refinement (AMAR) with kinetic models, such as discrete velocity and lattice Boltzmann methods. While refinement criteria for AMAR based on…
In this paper, we consider a class of structured nonsmooth fractional minimization, where the first part of the objective is the ratio of a nonnegative nonsmooth nonconvex function to a nonnegative nonsmooth convex function, while the…
In this paper, we aim to study the optimal weak convergence order for the finite element approximation to a stochastic Allen-Cahn equation driven by multiplicative white noise. We first construct an auxiliary equation based on the…
Alternating Direction Method of Multipliers (ADMM) is a popular convex optimization algorithm, which can be employed for solving distributed consensus optimization problems. In this setting agents locally estimate the optimal solution of an…
In this paper, we propose a general class of algorithms for optimizing an extensive variety of nonsmoothly penalized objective functions that satisfy certain regularity conditions. The proposed framework utilizes the…
The main purpose of this project is to develop a new active set method (ASM) called a working set method (WSM) for solving a general nonlinear inequality constrained minimization problem in a Hilber space. Mathematical analysis is carried…
The alternating direction method of multipliers (ADMM) is a popular method for solving convex separable minimization problems with linear equality constraints. The generalization of the two-block ADMM to the three-block ADMM is not trivial…
This paper concerns the McKean-Vlasov stochastic differential equation (SDE) with common noise. An appropriate definition of a weak solution to such an equation is developed. The importance of the notion of compatibility in this definition…
Dynamics of FitzHugh-Nagumo (FN) neuron ensembles with time-delayed couplings subject to white noises, has been studied by using both direct simulations and a semi-analytical augmented moment method (AMM) which has been proposed in a recent…
We present a Wave Operator Minimization (WOM) method for calculating the Fermi-Dirac density matrix for electronic structure problems at finite temperature while preserving physicality by construction using the wave operator, i.e., the…
We present a new map-making method for CMB measurements. The method is based on the destriping technique, but it also utilizes information about the noise spectrum. The low-frequency component of the instrument noise stream is modelled as a…
In this paper, we propose a novel solution for non-convex problems of multiple variables, especially for those typically solved by an alternating minimization (AM) strategy that splits the original optimization problem into a set of…
The convergence analysis for least-squares finite element methods led to various adaptive mesh-refinement strategies: Collective marking algorithms driven by the built-in a posteriori error estimator or an alternative explicit…
We consider the problem of minimising functions represented as a difference of lattice submodular functions. We propose analogues to the SupSub, SubSup and ModMod routines for lattice submodular functions. We show that our…