Riemannian Optimization on the Symplectic Stiefel Manifold
Not on the map. Why?
Abstract (arXiv)
The symplectic Stiefel manifold, denoted by Sp(2p,2n), is the set of linear symplectic maps between the standard symplectic spaces ℝ2p and ℝ2n. When p=n, it reduces to the well-known set of 2n× 2n symplectic matrices. Optimization problems on Sp(2p,2n) find applications in various areas, such as optics, quantum physics, numerical linear algebra and model order reduction of dynamical systems. The purpose of this paper is to propose and analyze gradient-descent methods on Sp(2p,2n), where the notion of gradient stems from a Riemannian metric. We consider a novel Riemannian metric on Sp(2p,2n) akin to the canonical metric of the (standard) Stiefel manifold. In order to perform a feasible step along the antigradient, we develop two types of search strategies: one is based on quasi-geodesic curves, and the other one on the symplectic Cayley transform. The resulting optimization algorithms are proved to converge globally to critical points of the objective function. Numerical experiments illustrate the efficiency of the proposed methods.
Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). First posted on arXiv 26 Jun 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 2; 2024: 3; 2025: 0; 2026: 3.
8 papers.
- 2023Symplectic Autoencoders for Model Reduction of Hamiltonian Systemscited by 5
- 2024Riemannian coordinate descent algorithms on matrix manifoldscited by 4
- 2024Batched Stochastic Bandit for Nondegenerate Functionscited by 2
- 2026IFNSO: Iteration-Free Newton-Schulz Orthogonalizationcited by 1
- 2023Symplectic Structure-Aware Hamiltonian (Graph) Embeddingscited by 0
- 2024Seg-HGNN: Unsupervised and Light-Weight Image Segmentation with Hyperbolic Graph Neural Networkscited by 0
- 2026Deflation-Free Optimal Scoringcited by 0
- 2026Direction-Magnitude Decomposition for Low-Rank Matrix Optimization: Faster Convergence and Saddle-to-saddle Dynamicscited by 0
- 2026Direction-Magnitude Decomposition for Low-Rank Matrix Optimization: Faster Convergence and Saddle-to-saddle Dynamics30 Jun 2026
- 2026Deflation-Free Optimal Scoring28 Apr 2026
- 2026IFNSO: Iteration-Free Newton-Schulz Orthogonalization18 Jan 2026
- 2024Seg-HGNN: Unsupervised and Light-Weight Image Segmentation with Hyperbolic Graph Neural Networks10 Sep 2024
- 2024Riemannian coordinate descent algorithms on matrix manifolds4 Jun 2024
- 2024Batched Stochastic Bandit for Nondegenerate Functions9 May 2024
- 2023Symplectic Autoencoders for Model Reduction of Hamiltonian Systems15 Dec 2023
- 2023Symplectic Structure-Aware Hamiltonian (Graph) Embeddings9 Sep 2023