Related papers: Algorithm 985: Simple, efficient, and relatively a…
In this paper, we propose a multi-step inertial Forward--Backward splitting algorithm for minimizing the sum of two non-necessarily convex functions, one of which is proper lower semi-continuous while the other is differentiable with a…
The Frank Wolfe algorithm (FW) is a popular projection-free alternative for solving large-scale constrained optimization problems. However, the FW algorithm suffers from a sublinear convergence rate when minimizing a smooth convex function…
We analyze two classical algorithms for solving additively composite convex optimization problems where the objective is the sum of a smooth term and a nonsmooth regularizer: proximal stochastic gradient method for a single regularizer; and…
Methods have previously been developed for the approximation of Lyapunov functions using radial basis functions. However these methods assume that the evolution equations are known. We consider the problem of approximating a given Lyapunov…
For the approximation and simulation of twofold iterated stochastic integrals and the corresponding L\'{e}vy areas w.r.t. a multi-dimensional Wiener process, we review four algorithms based on a Fourier series approach. Especially, the very…
The development of randomized algorithms for numerical linear algebra, e.g. for computing approximate QR and SVD factorizations, has recently become an intense area of research. This paper studies one of the most frequently discussed…
We derive $H_{\text{curl}}$-error estimates and improved $L^2$-error estimates for the Maxwell equations approximated using edge finite elements. These estimates only invoke the expected regularity pickup of the exact solution in the scale…
Building on the blueprint from Goemans and Williamson (1995) for the Max-Cut problem, we construct a polynomial-time approximation algorithm for orthogonally constrained quadratic optimization problems. First, we derive a semidefinite…
Evaluation of the Voigt function, a convolution of a Lorentzian and a Gaussian profile, is essential in various fields such as spectroscopy, atmospheric science, and astrophysics. Efficient computation of the function is crucial, especially…
This paper develops a posteriori error estimates of residual type for conforming and mixed finite element approximations of the fourth order Cahn-Hilliard equation $u_t+\De\bigl(\eps \De u-\eps^{-1} f(u)\bigr)=0$. It is shown that the {\it…
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…
Truncating the Fourier transform averaged by means of a generalized Hausdorff operator, we approximate the adjoint to that Hausdorff operator of the given function. We find the formulas for the rate of approximation in various metrics in…
In this paper, we propose a novel extrapolation coefficient scheme within a new extrapolation term and develop an accelerated proximal gradient algorithm. We establish that the algorithm achieves a sublinear convergence rate. The proposed…
Provided a special function of one variable and some of its derivatives can be accurately computed over a finite range, a method is presented to build a series of polynomial approximations of the function with a defined relative error over…
Many time series data mining problems can be solved with repeated use of distance measure. Examples of such tasks include similarity search, clustering, classification, anomaly detection and segmentation. For over two decades it has been…
In this paper, a computational method is developed to find an approximate solution of the stochastic Volterra-Fredholm integral equation using the Walsh function approximation and its operational matrix. Moreover, convergence and error…
As one of the asymptotic formulas of the zeta-function, Hardy and Littlewood gave asymptotic formulas called the approximate functional equation. In this paper, we prove an approximate functional equation of the Barnes double zeta-function…
Chebyshev rational approximation can be a viable method to compute the exponential of matrices with eigenvalues in the vicinity of the negative real axis, and it was recently applied successfully to solving nuclear fuel burnup equations.…
Approximation algorithms are widely used in many engineering problems. To obtain a data set for approximation a factorial design of experiments is often used. In such case the size of the data set can be very large. Therefore, one of the…
We present a family of algorithms for the numerical approximation of the Schr\"odinger equation with potential concentrated at a finite set of points. Our methods belong to the so-called fast and oblivious convolution quadrature algorithms.…