相关论文: On the Grassmann condition number

We analyze the probability that a random m-dimensional linear subspace of R^n both intersects a regular closed convex cone C\subseteq R^n and lies within distance \alpha of an m-dimensional subspace not intersecting C (except at the…

We offer a unified treatment of distinct measures of well-posedness for homogeneous conic systems. To that end, we introduce a distance to infeasibility based entirely on geometric considerations of the elements defining the conic system.…

We introduce and analyze a natural geometric version of Renegar's condition number R for the homogeneous convex feasibility problem associated with a regular cone C subseteq R^n. Let Gr_{n,m} denote the Grassmann manifold of m-dimensional…

The subject of this article is the introduction of a new concept of well-posedness of Bayesian inverse problems. The conventional concept of (Lipschitz, Hellinger) well-posedness in [Stuart 2010, Acta Numerica 19, pp. 451-559] is difficult…

In this paper, we introduce a general framework for analyzing the numerical conditioning of minimal problems in multiple view geometry, using tools from computational algebra and Riemannian geometry. Special motivation comes from the fact…

Comparing metric measure spaces (i.e. a metric space endowed with aprobability distribution) is at the heart of many machine learning problems. The most popular distance between such metric measure spaces is theGromov-Wasserstein (GW)…

We show that a suitable Slater condition implies a duality inequality between the Hoffman constants of the following feasibility problems: $$ \begin{array}{r} Ax-b \in S\\ x \in R \end{array} \qquad\text{ and }\qquad \begin{array}{r} c-A^T…

I revisit the condition number of computing left and right singular subspaces from [J.-G. Sun, Perturbation analysis of singular subspaces and deflating subspaces, Numer. Math. 73(2), pp. 235--263, 1996]. For real and complex matrices, I…

We resolve a basic problem on subspace distances that often arises in applications: How can the usual Grassmann distance between equidimensional subspaces be extended to subspaces of different dimensions? We show that a natural solution is…

We study the application of the Augmented Lagrangian Method to the solution of linear ill-posed problems. Previously, linear convergence rates with respect to the Bregman distance have been derived under the classical assumption of a…

We establish a necessary and sufficient condition for the differentiability of the distance function generated by a nonempty closed set K in a real normed linear space X under a proximinality condition on K. We do not assume the uniform…

For a k-flat F inside a locally compact CAT(0)-space X, we identify various conditions that ensure that F bounds a (k+1)-dimensional half flat in X. Our conditions are formulated in terms of the ultralimit of X. As applications, we obtain…

We study the convergence of the Riemannian steepest descent algorithm on the Grassmann manifold for minimizing the block version of the Rayleigh quotient of a symmetric matrix. Even though this problem is non-convex in the Euclidean sense…

Consider the linear equation $\mathbf{A}\mathbf{x}=\mathbf{y}$, where $\mathbf{A}$ is a $k\times N$-matrix, $\mathbf{x}\in\mathcal{K}\subset \mathbb{R}^N$ and $\mathbf{y}\in\mathbb{R}^M$ a given vector. When $\mathcal{K}$ is a convex set…

Motivated by recent interest in elastic problems in which the target space is non-Euclidean, we study a limit where local rest distances within an elastic body are incompatible, yet close to, distances within the ambient space.…

Let $g$ be a Riemannian metric for $\mathbf{R}^d$ ($d\geq 3$) which differs from the Euclidean metric only in a smooth and strictly convex bounded domain $M$. The lens rigidity problem is concerned with recovering the metric $g$ inside $M$…

We provide new conditions under which the alternating projection sequence converges in norm for the convex feasibility problem where a linear subspace with finite codimension $N\geq 2$ and a lattice cone in a Hilbert space are considered.…

The realizability problem is a well-known problem in the analysis of complex systems, which can be modeled as an infinite-dimensional moment problem. More precisely, as a truncated $K-$moment problem where $K$ is the space of all possible…

In inverse problems, many conditional generative models approximate the posterior measure by minimizing a distance between the joint measure and its learned approximation. While this approach also controls the distance between the posterior…

We address the question of whether a Riemannian manifold-with-boundary (M,g) in dimension two is uniquely determined from knowledge of the distances between points on its boundary. An affirmative answer is called boundary rigidity for…