Related papers: Lower bounds for the reach and applications

Riemannian optimization is a principled framework for solving optimization problems where the desired optimum is constrained to a smooth manifold $\mathcal{M}$. Algorithms designed in this framework usually require some geometrical…

We introduce numerical algebraic geometry methods for computing lower bounds on the reach, local feature size, and the weak feature size of the real part of an equidimensional and smooth algebraic variety using the variety's defining…

We study min-max theory for area functional among hypersurfaces constrained in a smooth manifold with boundary. A Schoen-Simon-type regularity result is proved for integral varifolds which satisfy a variational inequality and restrict to a…

In this paper we extend to non-compact Riemannian manifolds with boundary the use of two important tools in the geometric analysis of compact spaces, namely, the weak maximum principle for subharmonic functions and the integration by parts.…

In this paper we present a cubic regularized Newton's method to minimize a smooth function over a Riemannian manifold. The proposed algorithm is shown to reach a second-order $\epsilon$-stationary point within…

In 1960s, Almgren initiated a program to find minimal hypersurfaces in compact manifolds using min-max method. This program was largely advanced by Pitts and Schoen-Simon in 1980s when the manifold has no boundary. In this paper, we finish…

The subgradient method is a classical and foundational approach in non-smooth convex optimization; its simplicity, robustness, and role as a conceptual and algorithmic starting point have made it the backbone of many significant…

Separation bounds are a fundamental measure of the complexity of solving a zero-dimensional system as it measures how difficult it is to separate its zeroes. In the positive dimensional case, the notion of reach takes its place. In this…

Let $M^n$ be an $n$-dimensional Riemannian manifold with boundary $\partial M$. Assume that Ricci curvature is bounded from below by $(n-1)k$, for $k\in \RR$, we give a sharp estimate of the upper bound of $\rho(x)=\dis(x, \partial M)$, in…

We give a curvature dependent lower bound for the filling radius of all closed Riemannian manifolds as well as an upper one for manifolds which are the total space of a Riemannian submersion. The latter applies also to the case of…

The reach of a set $M \subset \mathbb R^d$, also known as condition number when $M$ is a manifold, was introduced by Federer in 1959. The reach is a central concept in geometric measure theory, set estimation, manifold learning, among…

Interesting data often concentrate on low dimensional smooth manifolds inside a high dimensional ambient space. Random projections are a simple, powerful tool for dimensionality reduction of such data. Previous works have studied bounds on…

We apply polynomial techniques (linear programming) to obtain lower and upper bounds on the covering radius of spherical designs as function of their dimension, strength, and cardinality. In terms of inner products we improve the lower…

This paper studies the lower bound complexity for the optimization problem whose objective function is the average of $n$ individual smooth convex functions. We consider the algorithm which gets access to gradient and proximal oracle for…

This paper focuses on minimizing a smooth function combined with a nonsmooth regularization term on a compact Riemannian submanifold embedded in the Euclidean space under a decentralized setting. Typically, there are two types of approaches…

We show that a realization of a closed connected PL-manifold of dimension n-1 in n-dimensional Euclidean space (n>2) is the boundary of a convex polyhedron (finite or infinite) if and only if the interior of each (n-3)-face has a point,…

The spectral radius {\rho}(G) of a digraph G is the maximum modulus of the eigenvalues of its adjacency matrix. We present bounds on {\rho}(G) that are often tighter and are applicable to a larger class of digraphs than previously reported…

Using deep analytic methods, Cheeger and Gromov showed that for any smooth (4k-1)-manifold there is a universal bound for the von Neumann $L^2$ $\rho$-invariants associated to arbitrary regular covers. We present a proof of the existence of…

The radius of regularity sometimes spelled as the radius of nonsingularity is a measure providing the distance of a given matrix to the nearest singular one. Despite its possible application strength this measure is still far from being…

This paper contains three main results. Firstly, we give an elementary proof of the following statement: Let $M$ be a (closed, in both the geometrical and topological sense of the word) topological manifold embedded in $\mathbb{R}^d$. If…