Related papers: On the continuous Fermat-Weber problem for a conve…

The inverse first-passage time problem determines a boundary such that the first-passage time of a Wiener process to this boundary has a given distribution. An approximation which is based on the starting value of the boundary to a smooth…

We study fully nonlinear geometric flows that deform strictly $k$-convex hypersurfaces in Euclidean space with pointwise normal speed given by a concave function of the principal curvatures. Specifically, the speeds we consider are obtained…

This work concerns about stochastic Burgers type equations with reflection. First of all, by means of the equicontinuous uniform Laplace principle, we prove the Freidlin-Wentzell uniform large deviation principle for these equations…

The idea of a finite collection of closed sets having "strongly regular intersection" at a given point is crucial in variational analysis. We show that this central theoretical tool also has striking algorithmic consequences. Specifically,…

We investigate the convergence of phase fields for the Willmore problem away from the support of a limiting measure $\mu$. For this purpose, we introduce a suitable notion of essentially uniform convergence. This mode of convergence is a…

We consider the problem of projecting a convex set onto a subspace, or equivalently formulated, the problem of computing a set obtained by applying a linear mapping to a convex feasible set. This includes the problem of approximating convex…

We investigate the differences and similarities of the Dirichlet problem of the mean curvature equation in the Euclidean space and in the Lorentz-Minkowski space. Although the solvability of the Dirichlet problem follows standards…

We consider distributed convex-concave saddle point problems over arbitrary connected undirected networks and propose a decentralized distributed algorithm for their solution. The local functions distributed across the nodes are assumed to…

The classical multi-set split feasibility problem seeks a point in the intersection of finitely many closed convex domain constraints, whose image under a linear mapping also lies in the intersection of finitely many closed convex range…

We consider mesh functions which are discrete convex in the sense that their central second order directional derivatives are positive. Analogous to the case of a uniformly bounded sequence of convex functions, we prove that the uniform…

It is well known that the Fourier--Bohr coefficients of regular model sets exist and are uniformly converging, volume-averaged exponential sums. Several proofs for this statement are known, all of which use fairly abstract machinery. For…

Distributed optimization is widely used in large-scale and privacy-preserving machine learning, where each agent stores a local objective and communicates only with its neighbors in a connected network. We study decentralized second-order…

We propose a variational approach to approximate measures with measures uniformly distributed over a 1 dimentional set. The problem consists in minimizing a Wasserstein distance as a data term with a regularization given by the length of…

In this article, we introduce a generalization of the diffusive motion of point-particles in a turbulent convective flow with given correlations to a polymer or membrane. In analogy to the passive scalar problem we call this the passive…

This work proposes a new formulation to the long-standing problem of convex decomposition through learning feature fields, enabling the first feed-forward model for open-world convex decomposition. Our method produces high-quality…

Discrete exterior calculus offers a coordinate--free discretization of exterior calculus especially suited for computations on meshes over curved manifolds. The discretization of the wedge product, that would be compatible with discrete…

The problem of computing a common point that lies in the intersection of a finite number of closed convex sets, each known to one agent in a network, is studied. This issue, known as the distributed convex feasibility problem or the…

We develop a cut finite element method (CutFEM) for convection-diffusion problems posed on mixed-dimensional domains, i.e., unions of manifolds of different dimensions arranged in a hierarchical structure where lower-dimensional components…

Defined mathematically as critical points of surface area subject to a volume constraint, constant mean curvatures (CMC) surfaces are idealizations of interfaces occurring between two immiscible fluids. Their behavior elucidates phenomena…

Suppose we are given two metric spaces and a family of continuous transformations from one to the other. Given a probability distribution on each of these two spaces - namely the source and the target measures - the Wasserstein alignment…