Related papers: On the Grassmann condition number

The standard Lense-Thirring metric is a century-old slow-rotation large-distance approximation to the gravitational field outside a rotating massive body, depending only on the total mass and angular momentum of the source. Although it is…

Flag measures are descriptors of convex bodies $K$ in $d$-dimensional Euclidean space generalizing the classical area measures. They have been used to provide general integral formulas for mixed volumes (see Hug, Rataj and Weil (2017)).…

If $K$ and $L$ are mutually dual closed convex cones in a Hilbert space with the metric projections onto them denoted by $P_K$ and $P_L$ respectively, then the following two assertions are equivalent: (i) $P_K$ is isotone with respect to…

This paper is concerned with the 1-D compressible Euler-Poisson equations with moving physical vacuum boundary condition. It is usually used to describe the motion of a self-gravitating inviscid gaseous star. The local well-posedness of…

The $k$-Even Set problem is a parameterized variant of the Minimum Distance Problem of linear codes over $\mathbb F_2$, which can be stated as follows: given a generator matrix $\mathbf A$ and an integer $k$, determine whether the code…

We give sufficient conditions for a measured length space (X,d,m) to admit local and global Poincare inequalities. We first introduce a condition DM on (X,d,m), defined in terms of transport of measures. We show that DM, along with a…

In this paper we investigate Lott-Sturm-Villani's synthetic lower Ricci curvature bound on Riemannian manifolds with boundary. We prove several measure rigidity results for some important functional and geometric inequalities, which…

In both real and complex cases, we establish the connection of the problem about $2$-dimensional linear subspaces the most deviating from the coordinate ones with one simply formulated optimization problem for isoperimetric polygons in…

In this paper we consider the iteratively regularized Gauss-Newton method for solving nonlinear ill-posed inverse problems. Under merely Lipschitz condition, we prove that this method together with an a posteriori stopping rule defines an…

We construct optimal low-rank approximations for the Gaussian posterior distribution in linear Gaussian inverse problems with possibly infinite-dimensional separable Hilbert parameter spaces and finite-dimensional data spaces. We first…

Here we show that any n-dimensional centrally symmetric convex body K has an n-dimensional perturbation T which is convex and centrally symmetric, such that the isotropic constant of T is universally bounded. T is close to K in the sense…

The Gromov-Wasserstein distances were proposed a few years ago to compare distributions which do not lie in the same space. In particular, they offer an interesting alternative to the Wasserstein distances for comparing probability measures…

We present a novel approach to Riemannian interpolation on the Grassmann manifold. Instead of relying on the Riemannian normal coordinates, i.e. the Riemannian exponential and logarithm maps, we approach the interpolation problem with an…

This paper studies estimation of and inference on a distribution function $F$ that is concave on the nonnegative half line and admits a density function $f$ with potentially unbounded support. When $F$ is strictly concave, we show that the…

We study some methods of subgradient projections for solving a convex feasibility problem with general (not necessarily hyperplanes or half-spaces) convex sets in the inconsistent case and propose a strategy that controls the relaxation…

We study random walks on $\mathrm{GL}_d(\mathbb{R})$ whose proximal dimension $r$ is larger than $1$ and whose limit set in the Grassmannian $\mathrm{Gr}_{r,d}(\mathbb{R})$ is not contained any Schubert variety. These random walks, without…

We strongly believe that in order to prove two important geometrical pro\-blems in convexity, namely, the G. Bianchi and P. Gruber's Conjecture \cite{bigru} and the J. A. Barker and D. G. Larman's Conjecture \cite{Barker}, it is necessary…

In a countably normed space which is a linear space equipped with a countable number of pair-wise compatible norms, we prove the existence of a common nearest point (in all norms) from a point outside a nonempty subset if this subset is…

The problem of finding suitable point embedding or geometric configurations given only Euclidean distance information of point pairs arises both as a core task and as a sub-problem in a variety of machine learning applications. In this…

We consider the problem of minimizing a function, which is the sum of a linear function and a composition of a strongly convex function with a linear transformation, over a compact polyhedral set. Jaggi and Lacoste-Julien [14] showed that…