Papers › Simpler Grassmannian optimization
Simpler Grassmannian optimization
Zehua Lai, Lek-Heng Lim, Ke Ye
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
There are two widely used models for the Grassmannian Gr(k,n), as the set of equivalence classes of orthogonal matrices O(n)/(O(k) ×O(n-k)), and as the set of trace-k projection matrices {P ∈ℝ^(n ×n) : P^𝖳 = P = P², tr(P) = k}. The former, standard in manifold optimization, has the advantage of giving numerically stable algorithms but the disadvantage of having to work with equivalence classes of matrices. The latter, widely used in coding theory and probability, has the advantage of using actual matrices (as opposed to equivalence classes) but working with projection matrices is numerically unstable. We present an alternative that has both advantages and suffers from neither of the disadvantages; by representing k-dimensional subspaces as symmetric orthogonal matrices of trace 2k-n, we obtain Gr(k,n) ≅{Q ∈O(n) : Q^𝖳 = Q, tr(Q) = 2k -n}. As with the other two models, we show that differential geometric objects and operations -- tangent vector, metric, normal vector, exponential map, geodesic, parallel transport, gradient, Hessian, etc -- have closed-form analytic expressions that are computable with standard numerical linear algebra. In the proposed model, these expressions are considerably simpler, a result of representing Gr(k,n) as a linear section of a compact matrix Lie group O(n), and can be computed with at most one QR decomposition and one exponential of a special skew-symmetric matrix that takes only O(nk(n-k)) time. In particular, we completely avoid eigen- and singular value decompositions in our steepest descent, conjugate gradient, quasi-Newton, and Newton methods for the Grassmannian.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections