Related papers: Compensated Convexity, Multiscale Medial Axis Maps…

K-Means clustering algorithm is one of the most commonly used clustering algorithms because of its simplicity and efficiency. K-Means clustering algorithm based on Euclidean distance only pays attention to the linear distance between…

We initiate the study of the norm-squared of the momentum map as a rigorous tool in infinite dimensions. In particular, we calculate the Hessian at a critical point, show that it is positive semi-definite along the complexified orbit, and…

Parallel transport is a fundamental tool to perform statistics on Rie-mannian manifolds. Since closed formulae don't exist in general, practitioners often have to resort to numerical schemes. Ladder methods are a popular class of algorithms…

This paper, the second of a series, deals with the function space of all smooth K\"ahler metrics in any given closed complex manifold $M$ in a fixed cohomology class. The previous result of the second author \cite{chen991} showed that the…

This paper proposes QPALM, a proximal augmented Lagrangian method based on quadratic approximations, for solving nonlinear programming problems with weakly convex objective and constraint functions. The algorithm is constructed by…

Most Machine Learning (ML) methods, from clustering to classification, rely on a distance function to describe relationships between datapoints. For complex datasets it is hard to avoid making some arbitrary choices when defining a distance…

We develop a multidimensional version of Gradient-MUSIC for estimating the frequencies of a nonharmonic signal from noisy samples. The guiding principle is that frequency recovery should be based only on the signal subspace determined by…

Let K be a convex set in R d and let K $\lambda$ be the convex hull of a homogeneous Poisson point process P $\lambda$ of intensity $\lambda$ on K. When K is a simple polytope, we establish scaling limits as $\lambda$ $\rightarrow$ $\infty$…

Let $n, m\ge 2$. Let $\Gamma<\text{SO}^\circ(n+1,1)$ be a Zariski dense convex cocompact subgroup and $\Lambda\subset\mathbb{S}^n$ be its limit set. Let $\rho : \Gamma \to \text{SO}^\circ(m+1,1)$ be a Zariski dense convex cocompact faithful…

Let $M=S^n/ \Gamma$ and $h$ be a nontrivial element of finite order $p$ in $\pi_1(M)$, where the integer $n, p\geq2$, $\Gamma$ is a finite abelian group which acts freely and isometrically on the $n$-sphere and therefore $M$ is…

We investigate the distance function $\boldsymbol{\delta}_{K}^{\phi}$ from an arbitrary closed subset $ K $ of a~finite-dimensional Banach space $ (\mathbf{R}^{n}, \phi) $, equipped with a uniformly convex $\mathcal{C}^{2}$-norm $ \phi $.…

A central property of a classical geometry is that the geodesic distance between two events is \emph{additive}. When considering quantum fluctuations in the metric or a quantum or statistical superposition of different spacetimes,…

The contribution of this work is twofold. The first part deals with a Hilbert-space version of McCann's celebrated result on the existence and uniqueness of monotone measure-preserving maps: given two probability measures $\rm P$ and $\rm…

The cosmological mass function problem is analyzed in full detail in the case of 1D gravity, with analytical, semi-analytical and numerical techniques. The extended Press & Schechter theory is improved by detailing the relation between…

Given a centrally symmetric convex body $K \subset \mathbb{R}^d$ and a positive number $\lambda$, we consider, among all ellipsoids $E \subset \mathbb{R}^d$ of volume $\lambda$, those that best approximate $K$ with respect to the symmetric…

The proximal gradient algorithm for minimizing the sum of a smooth and a nonsmooth convex function often converges linearly even without strong convexity. One common reason is that a multiple of the step length at each iteration may…

As observed by Auderset et al. (2005) and Wiesel (2012), viewing covariance matrices as elements of a Riemannian manifold and using the concept of geodesic convexity provide useful tools for studying M-estimators of multivariate scatter. In…

In this paper, we study the estimation of Gauss curvature for $K$-quasiconformal harmonic surface in ${\mathbb R}^3$ and present an accurate improvement of the previous result in [6, Theorem 5.2]. Let $X:M\rightarrow{\mathbb R}^3$ denote a…

This article derives closed-form parametric formulas for the Minkowski sums of convex bodies in d-dimensional Euclidean space with boundaries that are smooth and have all positive sectional curvatures at every point. Under these conditions,…

For explicit interface tracking in three dimensions, we propose a linear MARS method that (a) represents the interface by a partially ordered set of glued surfaces and approximates each glued surface with a triangular mesh, (b) maintains an…