Related papers: Convergence of numerical approximations to non-lin…
In this paper the local order of convergence used in iterative methods to solve nonlinear systems of equations is revisited, where shorter alternative analytic proofs of the order based on developments of multilineal functions are shown.…
Finite volume methods are proposed for computing approximate pathwise entropy/kinetic solutions to conservation laws with a rough path dependent flux function. For a convex flux, it is demonstrated that rough path oscillations may lead to…
Using stochastic quantization method we derive gauge-invariant equations, connecting multilocal vacuum correlators of nonperturbative field configurations immersed into the quantum background. Three alternative methods of stochastic…
We consider regularised quadratic optimal transport with subquadratic polynomial or entropic regularisation. In both cases, we prove interior Lipschitz-estimates on a transport-like map and interior gradient Lipschitz-estimates on the…
We extend the standard notion of self-concordance to non-convex optimization and develop a family of second-order algorithms with global convergence guarantees. In particular, two function classes -- \textit{weakly self-concordant}…
We present a novel approach, based entirely on the gravitational potential, for studying the evolution of non-linear cosmological matter perturbations. Starting from the perturbed Einstein equations, we integrate out the non-relativistic…
A Monte Carlo sampling of diagrammatic corrections to the non-crossing approximation is shown to provide numerically exact estimates of the long-time dynamics and steady state properties of nonequilibrium quantum impurity models. This…
We discuss technical results on learning function approximations using piecewise-linear basis functions, and analyze their stability and convergence using nonlinear contraction theory.
In this paper, we propose a first second-order scheme based on arbitrary non-Euclidean norms, incorporated by Bregman distances. They are introduced directly in the Newton iterate with regularization parameter proportional to the square…
A collision-based hybrid method for the discrete ordinates approximation of the multigroup neutron transport equation is developed for two-dimensional time-dependent problems. At each time step, this algorithm splits the neutron transport…
In this manuscript we study geometric regularity estimates for problems driven by fully nonlinear elliptic operators under strong absorption conditions. We establish improved geometric regularity along the free boundary, for a sharp value…
Developing a contemporary optimal transport (OT) solver requires navigating trade-offs among several critical requirements: GPU parallelization, scalability to high-dimensional problems, theoretical convergence guarantees, empirical…
Solutions of Rough Differential Equations (RDE) may be defined as paths whose increments are close to an approximation of the associated flow. They are constructed through a discrete scheme using a non-linear sewing lemma. In this article,…
We formulate a method of performing non-perturbative calculations in quantum field theory, based upon a derivative expansion of the exact renormalization group. We then proceed to apply this method to the calculation of critical exponents…
We propose a stochastic variance-reduced cubic regularized Newton method for non-convex optimization. At the core of our algorithm is a novel semi-stochastic gradient along with a semi-stochastic Hessian, which are specifically designed for…
The purpose of the paper is to provide a characterization of the error of the best polynomial approximation of composite functions in weighted spaces. Such a characterization is essential for the convergence analysis of numerical methods…
In this paper, we propose a new way to obtain optimal convergence rates for smooth stochastic (strong) convex optimization tasks. Our approach is based on results for optimization tasks where gradients have nonrandom noise. In contrast to…
We prove a quantitative mixing estimate for the Cauchy problem for transport along divergence-free vector fields with bounded variation. By developing a framework that quantifies Ambrosio's regularisation scheme, we derive the first…
We study the existing algorithms that solve the multidimensional martingale optimal transport. Then we provide a new algorithm based on entropic regularization and Newton's method. Then we provide theoretical convergence rate results and we…
This work is concerned with linear inverse problems where a distributed parameter is known a priori to only take on values from a given discrete set. This property can be promoted in Tikhonov regularization with the aid of a suitable convex…