Related papers: Convex valued geodesics and applications to sweepi…
We derive an implicit numerical scheme for the solution of advection equation where the roles of space and time variables are exchanged using the inverse Lax-Wendroff procedure. The scheme contains a linear weight for which it is always…
We prove a couple of new endpoint geodesic restriction estimates for eigenfunctions. In the case of general 3-dimensional compact manifolds, after a $TT^*$ argument, simply by using the $L^2$-boundedness of the Hilbert transform on $\R$, we…
Let $f \colon \mathcal{M} \to \mathbb{R}$ be a Lipschitz and geodesically convex function defined on a $d$-dimensional Riemannian manifold $\mathcal{M}$. Does there exist a first-order deterministic algorithm which (a) uses at most…
We study proximal random reshuffling for minimizing the sum of locally Lipschitz functions and a proper lower semicontinuous convex function without assuming coercivity or the existence of limit points. The algorithmic guarantees pertaining…
We consider a system of $n$ nonlocal interaction evolution equations on $\mathbb{R}^d$ with a differentiable matrix-valued interaction potential $W$. Under suitable conditions on convexity, symmetry and growth of $W$, we prove…
We show a Wolff-Denjoy type theorem in complete geodesic spaces in the spirit of Beardon's framework that unifies several results in this area. In particular, it applies to strictly convex bounded domains in $\mathbb{R}^{n}$ or…
We propose a general convex optimization problem for computing regularized geodesic distances. We show that under mild conditions on the regularizer the problem is well posed. We propose three different regularizers and provide analytical…
Given a Riemannian metric on the 2-sphere, sweep the 2-sphere out by a continuous one-parameter family of closed curves starting and ending at point curves. Pull the sweepout tight by, in a continuous way, pulling each curve as tight as…
Our contribution in this paper is two folded. We consider first the case of linear programming with real coefficients and give a method which allows the computation of a new upper bound on the distance from the origin to a feasible point.…
We present an algorithm for approximately solving bounded convex vector optimization problems. The algorithm provides both an outer and an inner polyhedral approximation of the upper image. It is a modification of the primal algorithm…
We prove bounds for the covering numbers of classes of convex functions and convex sets in Euclidean space. Previous results require the underlying convex functions or sets to be uniformly bounded. We relax this assumption and replace it…
The scaling of the exact solution of a hyperbolic balance law generates a family of scaled problems in which the source term does not depend on the current solution. These problems are used to construct a sequence of solutions whose…
This paper discusses several (sub)gradient methods attaining the optimal complexity for smooth problems with Lipschitz continuous gradients, nonsmooth problems with bounded variation of subgradients, weakly smooth problems with H\"older…
We expand the basic geometric elements of the simplex method to linear programs in locally convex topological vector spaces and provide conditions under which the method converges in value to optimality. This setting generalizes many…
We consider systems of conservation laws endowed with a convex entropy. We show the contraction, up to a translation, to extremal entropic shocks, for a pseudo-distance based on the notion of relative entropy. The contraction holds for…
Geodesic distance, sometimes called shortest path length, has proven useful in a great variety of applications, such as information retrieval on networks including treelike networked models. Here, our goal is to analytically determine the…
In this note we give an upper bound on the Hausdorff dimension of removable setsfor elliptic and canceling homogeneous differential operators with constant coefficients in the class of bounded functions, using a simple extension of…
Recent advances in quantitative unique continuation properties for solutions to uniformly elliptic, divergence form equations (with Lipschitz coefficients) has led to a good understanding of the vanishing order and size of singular and zero…
Under a convexity assumption on the boundary we solve a local inverse problem, namely we show that the geodesic X-ray transform can be inverted locally in a stable manner; one even has a reconstruction formula. We also show that under an…
A new geometric procedure to construct symplectic methods for constrained mechanical systems is developed in this paper. The definition of a map coming from the notion of retraction maps allows to adapt the continuous problem to the…