Related papers: Laplace Meets Moreau: Smooth Approximation to Infi…
We study the gap processes in a degenerate system of three particles interacting through their ranks. We obtain the Laplace transform of the invariant measure of these gaps, and an explicit expression for the corresponding invariant…
This article handles in a short manner a few Laplace transform pairs and some extensions to the basic equations are developed. They can be applied to a wide variety of functions in order to find the Laplace transform or its inverse when…
We introduce a transformation of linear Pfaffian systems, which we call the middle Laplace transform, as a formulation of the Laplace transform from the perspective of Katz theory. While the definition of the middle Laplace transform is…
The augmented Lagrangian method (ALM) is one of the most useful methods for constrained optimization. Its convergence has been well established under convexity assumptions or smoothness assumptions, or under both assumptions. ALM may…
In this article, we develop a new method to approximate numerically the fractional Laplacian of functions defined on $\mathbb R$, as well as some more general singular integrals. After mapping $\mathbb R$ into a finite interval, we…
We explore the connection between fractional order partial differential equations in two or more spatial dimensions with boundary integral operators to develop techniques that enable one to efficiently tackle the integral fractional…
We use the Laplace transform and the Gamma function to introduce a new integral transform and name it the Laplace-type transform possessing the property of mapping a function to a functional sequence, which cannot be achieved by the Laplace…
Laplace approximations are commonly used to approximate high-dimensional integrals in statistical applications, but the quality of such approximations as the dimension of the integral grows is not well understood. In this paper, we prove a…
In large-scale optimization, the presence of nonsmooth and nonconvex terms in a given problem typically makes it hard to solve. A popular approach to address nonsmooth terms in convex optimization is to approximate them with their…
The paper deals with the optimal control problem described by second order evolution differential inclusions; to this end first we use an auxiliary problem with second order discrete and discrete-approximate inclusions. Then applying…
A new method is introduced for solving Laplace problems on 2D regions with corners by approximation of boundary data by the real part of a rational function with fixed poles exponentially clustered near each corner. Greatly extending a…
We study the problem of minimizing a $m$-weakly convex and possibly nonsmooth function. Weak convexity provides a broad framework that subsumes convex, smooth, and many composite nonconvex functions. In this work, we propose a…
In this work the minimization problem for the difference of convex (DC) functions is studied by using Moreau envelopes and the descent method with Moreau gradient is employed to approximate the numerical solution. The main regularization…
The Laplace approximation (LA) to posteriors is a ubiquitous tool to simplify Bayesian computation, particularly in the high-dimensional settings arising in Bayesian inverse problems. Precisely quantifying the LA accuracy is a challenging…
We introduce the linear operators of fractional integration and fractional differentiation in the framework of the Riemann-Liouville fractional calculus. Particular attention is devoted to the technique of Laplace transforms for treating…
The conjugate function method is an algorithm for numerical computation of conformal mappings for simply and multiply connected domains. In this paper, the conjugate function method is extended to cover conformal mappings between Riemannian…
We construct a finite element method (FEM) for the infinity Laplacian. Solutions of this problem may be singular, which has prompted us to conduct an a posteriori analysis of the method deriving residual based estimators to drive an…
We consider a nonsmooth optimization problem on Riemannian manifold, whose objective function is the sum of a differentiable component and a nonsmooth convex function. We propose a manifold inexact augmented Lagrangian method (MIALM) for…
We deal with the higher-order fractional Laplacians by two methods: the integral method and the system method. The former depends on the integral equation equivalent to the differential equation. The latter works directly on the…
In this paper we analyze several inexact fast augmented Lagrangian methods for solving linearly constrained convex optimization problems. Mainly, our methods rely on the combination of excessive-gap-like smoothing technique developed in…