Related papers: Convergence rates of particle approximation of for…
In this paper we present a new method for solving optimization problems involving the sum of two proper, convex, lower semicontinuous functions, one of which has Lipschitz continuous gradient. The proposed method has a hybrid nature that…
In this paper we focus on the convergence analysis of the forward-backward splitting method for solving nonsmooth optimization problems in Hilbert spaces when the objective function is the sum of two convex functions. Assuming that one of…
We prove precise rates of convergence for monotone approximation schemes of fractional and nonlocal Hamilton-Jacobi-Bellman (HJB) equations. We consider diffusion corrected difference-quadrature schemes from the literature and new…
In this paper, we propose an adaptive forward-backward-forward splitting algorithm for finding a zero of a pseudo-monotone operator which is split as a sum of three operators: the first is continuous single-valued, the second is…
A new method for numerical solving of boundary problem for ordinary differential equations with slowly varying coefficients which is aimed at better representation of solutions in the regions of their rapid oscillations or exponential…
We present a new approximation scheme for the centrifugal term to solve the Schrodinger equation with the Hulthen potential for any arbitrary l state by means of a mathematical Nikiforov-Uvarov (NU) method. We obtain the bound state energy…
In this paper we propose two proximal gradient algorithms for fractional programming problems in real Hilbert spaces, where the numerator is a proper, convex and lower semicontinuous function and the denominator is a smooth function, either…
This paper is concerned with stochastic incompressible Navier-Stokes equations with multiplicative noise in two dimensions with respect to periodic boundary conditions. Based on the Helmholtz decomposition of the multiplicative noise,…
This work is concerned with the equation $ \partial_t \rho = \Delta_x \rho^m $, $ m > 1 $, known as the porous medium equation. It shows stability of the pressure of solutions close to flat travelling wave fronts in the homogeneous…
A high-frequency recovered fully discrete low-regularity integrator is constructed to approximate rough and possibly discontinuous solutions of the semilinear wave equation. The proposed method, with high-frequency recovery techniques, can…
This paper addresses a quadratic problem with assignment constraints, an NP-hard combinatorial optimization problem arisen from facility location, multiple-input multiple-output detection, and maximum mean discrepancy calculation et al. The…
We present two modified versions of the primal-dual splitting algorithm relying on forward-backward splitting proposed in \cite{vu} for solving monotone inclusion problems. Under strong monotonicity assumptions for some of the operators…
We derive quantitative bounds in the Wasserstein distance for the approximation of stochastic integrals with respect to Hawkes processes by a normally distributed random variable. In the case of deterministic and non-negative integrands,…
In this paper, we consider the convergence rate with respect to Wasserstein distance in the invariance principle for deterministic nonuniformly hyperbolic systems, where both discrete time systems and flows are included. Our results apply…
The pencil-beam model is valid only when elementary Gaussian beams are small enough with respect to lateral heterogeneity of a medium, which is not always the case in heavy charged particle radiotherapy. This work addresses a solution for…
We investigate the convergence properties of the EM algorithm when applied to overspecified Gaussian mixture models -- that is, when the number of components in the fitted model exceeds that of the true underlying distribution. Focusing on…
An extension of the Gauss-Newton algorithm is proposed to find local minimizers of penalized nonlinear least squares problems, under generalized Lipschitz assumptions. Convergence results of local type are obtained, as well as an estimate…
Particle smoothers are widely used algorithms allowing to approximate the smoothing distribution in hidden Markov models. Existing algorithms often suffer from slow computational time or degeneracy. We propose in this paper a way to improve…
We provide a general bound on the Wasserstein distance between two arbitrary distributions of sequences of Bernoulli random variables. The bound is in terms of a mixing quantity for the Glauber dynamics of one of the sequences, and a simple…
Variational inference (VI) seeks to approximate a target distribution $\pi$ by an element of a tractable family of distributions. Of key interest in statistics and machine learning is Gaussian VI, which approximates $\pi$ by minimizing the…