Related papers: The Adams-Bashforth-Moulton Integration Methods Ge…
Many structured data-fitting applications require the solution of an optimization problem involving a sum over a potentially large number of measurements. Incremental gradient algorithms offer inexpensive iterations by sampling a subset of…
This paper investigates the use of stratified sampling as a variance reduction technique for approximating integrals over large dimensional spaces. The accuracy of this method critically depends on the choice of the space partition, the…
We present an accelerated, or 'look-ahead' version of the Newton-Dinkelbach method, a well-known technique for solving fractional and parametric optimization problems. This acceleration halves the Bregman divergence between the current…
We present AMPS, an augmented matrix approach to update the solution to a linear system of equations when the matrix is modified by a few elements within a principal submatrix. This problem arises in the dynamic security analysis of a power…
In this paper, we explore a specific optimization problem that involves the combination of a differentiable nonconvex function and a nondifferentiable function. The differentiable component lacks a global Lipschitz continuous gradient,…
As a preliminary step towards simulating binary neutron star coalescing problem, we test a post-Newtonian approach by constructing a single neutron star model. We expand the Tolman-Oppenheimer-Volkov equation of hydrostatic equilibrium by…
Motivated by gradient methods in optimization theory, we give methods based on $\psi$-fractional derivatives of order $\alpha$ in order to solve unconstrained optimization problems. The convergence of these methods is analyzed in detail.…
Implicit solvers present strong limitations when used on supercomputing facilities and in particular for adaptive mesh-refinement codes. We present a new method for implicit adaptive time-stepping on adaptive mesh refinement-grids. We…
An efficient proximal-gradient-based method, called proximal extrapolated gradient method, is designed for solving monotone variational inequality in Hilbert space. The proposed method extends the acceptable range of parameters to obtain…
We describe a grid-based numerical method for 3D hydrodynamic cosmological simulations which is adaptive in space and time and combines the best features of higher order--accurate Godunov schemes for Eulerian hydrodynamics with adaptive…
A grid-based real-space implementation of the Projector Augmented Wave (PAW) method of P. E. Blochl [Phys. Rev. B 50, 17953 (1994)] for Density Functional Theory (DFT) calculations is presented. The use of uniform 3D real-space grids for…
The recently proposed Muon optimizer updates weight matrices via orthogonalized momentum and has demonstrated strong empirical success in large language model training. However, it remains unclear how to determine the learning rates for…
Hamiltonian Monte-Carlo (HMC) and its auto-tuned variant, the No U-Turn Sampler (NUTS) can struggle to accurately sample distributions with complex geometries, e.g., varying curvature, due to their constant step size for leapfrog…
The paper presents a numerical analysis of the class of mathematical models of linear fractional oscillators, which is the Cauchy problem for a differential equation with derivatives of fractional orders in the sense of Gerasimov-Caputo. A…
A recent reformulation [1] of the problem of Coulomb gases in the presence of a dynamical dielectric medium showed that finite temperature simulations of such systems can be accomplished on the basis of completely local Hamiltonians on a…
We develop new adaptive algorithms for temporal integration of nonlinear evolution equations on tensor manifolds. These algorithms, which we call step-truncation methods, are based on performing one time step with a conventional…
One well adopted power grid simulation methodology is to factorize matrix once and perform only backward forward substitution with a deliberately chosen step size along the simulation. Since the required simulation time is usually long for…
This paper explores adaptive variance reduction methods for stochastic optimization based on the STORM technique. Existing adaptive extensions of STORM rely on strong assumptions like bounded gradients and bounded function values, or suffer…
In this paper, we propose the Bregman Douglas-Rachford splitting (BDRS) method and its variant Bregman Peaceman-Rachford splitting method for solving maximal monotone inclusion problem. We show that BDRS is equivalent to a Bregman…
The Alternating Direction Method of Multipliers (ADMM) provides a natural way of solving inverse problems with multiple partial differential equations (PDE) forward models and nonsmooth regularization. ADMM allows splitting these…