Related papers: Discrete soliton equations and convergence acceler…
We revisit the general framework introduced by Fazylab et al. (SIAM J. Optim. 28, 2018) to construct Lyapunov functions for optimization algorithms in discrete and continuous time. For smooth, strongly convex objective functions, we relax…
A recent article in J. Chem. Phys. argues that the two algorithms, the velocity-Verlet, and position-Verlet integrators, commonly used in Molecular Dynamics (MD) simulations, are different \cite{Ni2024}. But not only are the two algorithms…
We express discrete Painlev\'e equations as discrete Hamiltonian systems. The discrete Hamiltonian systems here mean the canonical transformations defined by generating functions. Our construction relies on the classification of the…
Discrete integrable equations over finite fields are investigated. The indeterminacy of the equation is resolved by treating it over a field of rational functions instead of the finite field itself. The main discussion concerns a…
The fastest quantum algorithms (for the solution of classical computational tasks) known so far are basically variations of the hidden subgroup problem with {$f(U[x])=f(x)$}. Following a discussion regarding which tasks might be solved…
We propose an accelerated meta-algorithm, which allows to obtain accelerated methods for convex unconstrained minimization in different settings. As an application of the general scheme we propose nearly optimal methods for minimizing…
A theory for constructing integrable couplings of soliton equations is developed by using various perturbations around solutions of perturbed soliton equations being analytic with respect to a small perturbation parameter. Multi-scale…
The derivation of second-order ordinary differential equations (ODEs) as continuous-time limits of optimization algorithms has been shown to be an effective tool for the analysis of these algorithms. Additionally, discretizing…
For a polygon in Euclidean space we consider a transformation T which is obtained by applying the midpoints polygon construction twice and using an index shift. For a closed polygon this is a curve shortening process. A polygon is called…
Inspired by the forms of delay-Painleve equations, we consider some new differential-discrete systems of KdV, mKdV and Sine-Gordon - type related by simple one way Miura transformations to classical ones. Using Hirota bilinear formalism we…
We propose a recursive representation of solutions to an ultradiscrete analogue of the discrete KP hierarchy, which is the master equation of discrete soliton equations. We also propose a class of solutions which can be used to start the…
Direct and inverse problems for the Hirota difference equation are considered. Jost solutions and scattering data are introduced and their properties are presented. Darboux transformation in a special case is shown to give evolution with…
Stochastic variance reduced optimization methods are known to be globally convergent while they suffer from slow local convergence, especially when moderate or high accuracy is needed. To alleviate this problem, we propose an optimization…
We define bi-infinite versions of four well-studied discrete integrable models, namely the ultra-discrete KdV equation, the discrete KdV equation, the ultra-discrete Toda equation, and the discrete Toda equation. For each equation, we show…
We study a catching-up algorithm for a class of differential inclusions driven by maximal monotone operators with continuous perturbations. Using a decomposition of the monotone operator into the closed convex hull of its single-valued part…
We define discrete Hamiltonian systems in the framework of discrete embeddings. An explicit comparison with previous attempts is given. We then solve the discrete Helmholtz's inverse problem for the discrete calculus of variation in the…
In this work, we study advection-robust Hybrid High-Order discretizations of the Oseen equations. For a given integer $k\ge 0$, the discrete velocity unknowns are vector-valued polynomials of total degree $\le k$ on mesh elements and faces,…
Nonlinear systems of partial differential equations (PDEs) may permit several distinct solutions. The typical current approach to finding distinct solutions is to start Newton's method with many different initial guesses, hoping to find…
We study the convergence of the Augmented Decomposition Algorithm (ADA) proposed in [32] for solving multi-block separable convex minimization problems subject to linear constraints. We show that the global convergence rate of the exact ADA…
Ordinary differential equations (ODEs) and ordinary difference systems (O$\Delta$Ss) invariant under the actions of the Lie groups $\mathrm{SL}_x(2)$, $\mathrm{SL}_y(2)$ and $\mathrm{SL}_x(2)\times\mathrm{SL}_y(2)$ of projective…