Related papers: Multigrade efficient congruencing and Vinogradov's…
We express the asymptotics of the remainders of the partial sums {s_n} of the generalized hypergeometric function q+1_F_q through an inverse power series z^n n^l \sum_k c_k/n^k, where the exponent l and the asymptotic coefficients {c_k} may…
We develop an elementary mean field approach for fully asymmetric kinetic Ising models, which can be applied to a single instance of the problem. In the case of the asymmetric SK model this method gives the exact values of the local…
In this paper, we propose a fast proximal gradient algorithm for multiobjective optimization, it is proved that the convergence rate of the accelerated algorithm for multiobjective optimization developed by Tanabe et al. can be improved…
In recent years, accelerated extra-gradient methods have attracted much attention by researchers, for solving monotone inclusion problems. A limitation of most current accelerated extra-gradient methods lies in their direct utilization of…
We consider a method for the approximation of iterated stochastic integrals of arbitrary multiplicity $k$ $(k\in \mathbb{N})$ with respect to the infinite-dimensional $Q$-Wiener process using the mean-square approximation method of iterated…
Error estimates for the numerical solution of the master equation are presented. Estimates are based on adjoint methods. We find that a good estimate can often be computed without spending computational effort on a dual problem. Estimates…
In this paper, we propose a second-order continuous primal-dual dynamical system with time-dependent positive damping terms for a separable convex optimization problem with linear equality constraints. By the Lyapunov function approach, we…
Consider a Urysohn integral equation $x - \mathcal{K} (x) = f$, where $f$ and the integral operator $\mathcal{K}$ with kernel of the type of Green's function are given. In the computation of approximate solutions of the given integral…
We show that for integers $k\geq 4$ and $s\geq k^2+(3k-1)/4$, we have an asymptotic formula for the number of solutions, in positive integers $x_i$, to the inequality $\left|(x_1-\theta_1)^k+\dotsc+(x_s-\theta_s)^k-\tau\right|<\eta$, where…
In this paper, we study an adaptive finite element method for multiple eigenvalue problems of a class of second order elliptic equations. By using some eigenspace approximation technology and its crucial property which is also presented in…
A fundamental task in numerical computation is the solution of large linear systems. The conjugate gradient method is an iterative method which offers rapid convergence to the solution, particularly when an effective preconditioner is…
The theme of the present paper is numerical integration of $C^r$ functions using randomized methods. We consider variance reduction methods that consist in two steps. First the initial interval is partitioned into subintervals and the…
We find two-sides estimates for the best uniform approximations of classes of convolutions of $2\pi$-periodic functions from unit ball of the space $L_p, 1 \le p <\infty,$ with fixed kernels, modules of Fourier coefficients of which satisfy…
We propose a single time-scale stochastic subgradient method for constrained optimization of a composition of several nonsmooth and nonconvex functions. The functions are assumed to be locally Lipschitz and differentiable in a generalized…
Building on a variant of the Jarzynski equation we propose a new method to numerically determine the prior-predictive value in a Bayesian inference problem. The method generalizes thermodynamic integration and is not hampered by…
Gradient matching is a promising tool for learning parameters and state dynamics of ordinary differential equations. It is a grid free inference approach, which, for fully observable systems is at times competitive with numerical…
In this work, we study the computational complexity of reducing the squared gradient magnitude for smooth minimax optimization problems. First, we present algorithms with accelerated $\mathcal{O}(1/k^2)$ last-iterate rates, faster than the…
It is well-known that accelerated gradient first order methods possess optimal complexity estimates for the class of convex smooth minimization problems. In many practical situations, it makes sense to work with inexact gradients. However,…
We consider simultaneous Waring decompositions: Given forms $ f_d $ of degrees $ kd $, $ (d = 2,3 )$, which admit a representation as $ d $-th power sums of $ k $-forms $ q_1,\ldots,q_m $, when is it possible to reconstruct the addends $…
A superconvergence error estimate for the gradient approximation of the second order elliptic problem in three dimensions is analyzed by using weak Galerkin finite element scheme on the uniform and non-uniform cubic partitions. Due to the…