Efficient quasi-geodesics on the Stiefel manifold
From MaRDI portal
Publication:2117940
Abstract: Solving the so-called geodesic endpoint problem, i.e., finding a geodesic that connects two given points on a manifold, is at the basis of virtually all data processing operations, including averaging, clustering, interpolation and optimization. On the Stiefel manifold of orthonormal frames, this problem is computationally involved. A remedy is to use quasi-geodesics as a replacement for the Riemannian geodesics. Quasi-geodesics feature constant speed and covariant acceleration with constant (but possibly non-zero) norm. For a well-known type of quasi-geodesics, we derive a new representation that is suited for large-scale computations. Moreover, we introduce a new kind of quasi-geodesics that turns out to be much closer to the Riemannian geodesics.
Recommendations
- Endpoint geodesics on the Stiefel manifold embedded in Euclidean space
- Computing the Riemannian logarithm on the Stiefel manifold: metrics, methods, and performance
- A multi-parameter family of metrics on Stiefel manifolds and applications
- Closed-form geodesics and optimization for Riemannian logarithms of Stiefel and flag manifolds
- A modified Casteljau algorithm to solve interpolation problems on Stiefel manifolds
Cites work
- scientific article; zbMATH DE number 5223994 (Why is no real title available?)
- scientific article; zbMATH DE number 5047793 (Why is no real title available?)
- A matrix-algebraic algorithm for the Riemannian logarithm on the Stiefel manifold under the canonical metric
- A modified Casteljau algorithm to solve interpolation problems on Stiefel manifolds
- Extremal curves on Stiefel and Grassmann manifolds
- The Geometry of Algorithms with Orthogonality Constraints
Cited in
(6)- Endpoint geodesics on the Stiefel manifold embedded in Euclidean space
- A collection of efficient retractions for the symplectic Stiefel manifold
- Computing the Riemannian logarithm on the Stiefel manifold: metrics, methods, and performance
- Riemannian conjugate gradient methods: general framework and specific algorithms with convergence analyses
- Closed-form geodesics and optimization for Riemannian logarithms of Stiefel and flag manifolds
- Nonmonotone feasible arc search algorithm for minimization on Stiefel manifold
This page was built for publication: Efficient quasi-geodesics on the Stiefel manifold
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117940)