Related papers: Convergence of a Normalized Gradient Algorithm for…
The article addresses the convergence of implicit and semi-implicit, fully discrete approximations of a class of nonlinear parabolic evolution problems. Such schemes are popular in the numerical solution of evolutions defined with the…
The proximal gradient algorithm for minimizing the sum of a smooth and a nonsmooth convex function often converges linearly even without strong convexity. One common reason is that a multiple of the step length at each iteration may…
Despite its popularity in the reinforcement learning community, a provably convergent policy gradient method for continuous space-time control problems with nonlinear state dynamics has been elusive. This paper proposes proximal gradient…
We consider the study of a numerical scheme for an initial- and Dirichlet boundary- value problem for a nonlinear Schr\"odinger equation. We approximate the solution using a, local (non-uniform) two level scheme in time (see C. Besse [6]…
In this paper we investigate a priori error estimates for the space-time Galerkin finite element discretization of a simplified semilinear gradient enhanced damage model. The model equations are of a special structure as the state equation…
Imaginary time evolution is a powerful technique for computing the ground state of quantum Hamiltonians, where the convergence to ground state in asymptotic imaginary time is guaranteed. However, implementing this method on quantum…
In this paper we study the problem of convergence and generalization error bound of stochastic momentum for deep learning from the perspective of regularization. To do so, we first interpret momentum as solving an $\ell_2$-regularized…
Gradient algorithms are classical in adaptive control and parameter estimation. For instantaneous quadratic cost functions they lead to a linear time-varying dynamic system that converges exponentially under persistence of excitation…
The projected entangled pair states (PEPS) methods have been proved to be powerful tools to solve the strongly correlated quantum many-body problems in two-dimension. However, due to the high computational scaling with the virtual bond…
This paper is concerned with the adaptive numerical treatment of stochastic partial differential equations. Our method of choice is Rothe's method. We use the implicit Euler scheme for the time discretization. Consequently, in each step, an…
A linear implicit finite difference method is proposed for the approximation of the solution to a periodic, initial value problem for a Schrodinger-Hirota equation. Optimal, second order convergence in the discrete $H^1-$norm is proved,…
Finding the ground state of a Hamiltonian system is of great significance in many-body quantum physics and quantum chemistry. We propose an improved iterative quantum algorithm to prepare the ground state of a Hamiltonian. The crucial point…
A new efficient numerical algorithm for interacting fermion systems is proposed and examined in detail. The ground state is expressed approximately by a linear combination of numerically chosen basis states in a truncated Hilbert space. Two…
Computing many eigenpairs of the Schr{\"o}dinger operator presents a computational bottleneck in large-scale quantum simulations due to the global communication overhead of explicit orthogonalization. To address this issue, we propose a…
This paper presents a rigorous convergence analysis of the $L^{p+1}$-normalized gradient flow with asymptotic Lagrange multiplier (GFALM) method for computing the action ground state of the nonlinear Schr\"odinger equation in the focusing…
We introduce a novel spatial discretization technique for the reliable and efficient simulation of magnetization dynamics governed by the Landau-Lifshitz (LL) equation. The overall discretization error is systematically decomposed into…
Prior work on computable defect-based local error estimators for (linear) time-reversible integrators is extended to nonlinear and nonautonomous evolution equations. We prove that the asymptotic results from the linear case [W. Auzinger and…
We analyze convergence of gradient-descent methods on Riemannian manifolds. In particular, we study randomization of Riemannian gradient algorithms for minimizing smooth cost functions (of Morse-Bott type). We prove that randomized gradient…
This paper focuses on minimizing a smooth function combined with a nonsmooth regularization term on a compact Riemannian submanifold embedded in the Euclidean space under a decentralized setting. Typically, there are two types of approaches…
A new numerical treatment in the Crank-Nicholson method with the imaginary time evolution operator is presented in order to solve the Schr\"{o}dinger equation. The original time evolution technique is extended to a new operator that…