Related papers: Improved convergence estimates for the Schr\"oder-…
We resolve the problem of optimal regularity and Uhlenbeck compactness for affine connections in General Relativity and Mathematical Physics. First, we prove that any affine connection $\Gamma$, with components $\Gamma \in L^{2p}$ and…
In recent years, the proximal gradient method and its variants have been generalized to Riemannian manifolds for solving optimization problems with an additively separable structure, i.e., $f + h$, where $f$ is continuously differentiable,…
The Sinkhorn algorithm is the most popular method for solving the entropy minimization problem called the Schr\"odinger problem: in the non-degenerate cases, the latter admits a unique solution towards which the algorithm converges…
Consider a real matrix $\Theta$ consisting of rows $(\theta_{i,1},\ldots,\theta_{i,n})$, for $1\leq i\leq m$. The problem of making the system linear forms $x_{1}\theta_{i,1}+\cdots+x_{n}\theta_{i,n}-y_{i}$ for integers $x_{j},y_{i}$ small…
We develop an algebraic approach to studying the spectral properties of the stationary Schr\"odinger equation in one dimension based on its high order conditional symmetries. This approach makes it possible to obtain in explicit form…
Optimization on Riemannian manifolds widely arises in eigenvalue computation, density functional theory, Bose-Einstein condensates, low rank nearest correlation, image registration, and signal processing, etc. We propose an adaptive…
A classical problem in constant mean curvature hypersurface theory is, for given $H\geq 0$, to determine whether a compact submanifold $\Gamma^{n-1}$ of codimension two in Euclidean space $\R_+^{n+1}$, having a single valued orthogonal…
Consider $n$ linearly independent vectors in $\mathbb{C}^n$ which form columns of a matrix $A$. The recursive evaluation of eigen directions (normalized eigenvectors) of $A$ is the solution of an eigenvalue problem of the form…
Let $X_1,\dots,X_n$ be i.i.d. log-concave random vectors in $\mathbb R^d$ with mean 0 and covariance matrix $\Sigma$. We study the problem of quantifying the normal approximation error for $W=n^{-1/2}\sum_{i=1}^nX_i$ with explicit…
Computational optimal transport (OT) has recently emerged as a powerful framework with applications in various fields. In this paper we focus on a relaxation of the original OT problem, the entropic OT problem, which allows to implement…
In this note it is shown that if $\mu$ is an $n$-Ahlfors regular measure in $\mathbb R^{n+1}$ such that the $n$-dimensional Riesz transform is bounded in $L^2(\mu)$ and the so-called BAUPP (bilateral approximation by unions of parallel…
We review and provide simplified proofs related to the Magnus expansion, and improve convergence estimates. Observations and improvements concerning the Baker--Campbell--Hausdorff expansion are also made. In this Part III, we consider the…
In this paper, we investigate the Dirichlet problem of Laplacian on complete Riemannian manifolds. By constructing new trial functions, we obtain a sharp upper bound of the gap of the consecutive eigenvalues in the sense of the order, which…
It is shown that the uniform radius of spatial analyticity $\sigma(t)$ of solutions at time $t$ to the 1d, 2d and 3d cubic nonlinear Schr\"{o}dinger equations cannot decay faster than $1/|t|$ as $|t| \to \infty$, given initial data that is…
Let $M(\mathbb{T}^d)$ be the space of complex bounded Radon measures defined on the $d$-dimensional torus group $(\mathbb{R}/\mathbb{Z})^d=\mathbb{T}^d$, equipped with the total variation norm $\|\cdot\|$; and let $\hat\mu$ denote the…
A perfect matching in a graph $G$ is a set of nonadjacent edges covering every vertex of $G$. Motivated by recent progress on the relations between the eigenvalues and the matching number of a graph, in this paper, we aim to present a…
Gradient Langevin dynamics and a variety of its variants have attracted increasing attention owing to their convergence towards the global optimal solution, initially in the unconstrained convex framework while recently even in convex…
We propose an inexact proximal augmented Lagrangian framework with explicit inner problem termination rule for composite convex optimization problems. We consider arbitrary linearly convergent inner solver including in particular stochastic…
Let $\Gamma =(V,E)$ be a point-symmetric reflexive relation and let $v\in V$ such that $|\Gamma (v)|$ is finite (and hence $|\Gamma (x)|$ is finite for all $x$, by the transitive action of the group of automorphisms). Let $j\in \N$ be an…
We propose a new first-order augmented Lagrangian algorithm ALCC for solving convex conic programs of the form min{rho(x)+gamma(x): Ax-b in K, x in chi}, where rho and gamma are closed convex functions, and gamma has a Lipschitz continuous…