A collection of efficient retractions for the symplectic Stiefel manifold

DOI10.1007/s40314-023-02302-0zbMath1524.65224MaRDI QIDQ6161103

No author found.

Publication date: 2 June 2023

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

symplectic matrixRiemannian optimizationsymplectic Stiefel manifoldRiemannian gradient method

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical mathematical programming methods (65K05) Methods of reduced gradient type (90C52)

Related Items (1)

Optimization on the symplectic Stiefel manifold: SR decomposition-based retraction and applications

Cites Work

• Unnamed Item
• Unnamed Item
• A feasible method for optimization with orthogonality constraints
• A framework of constraint preserving update schemes for optimization on Stiefel manifold
• Gaussian quantum marginal problem
• Computation of functions of Hamiltonian and skew-symmetric matrices
• A symplectic method for approximating all the eigenvalues of a Hamiltonian matrix
• \(SR\) and \(SZ\) algorithms for the symplectic (butterfly) eigenproblem
• The symplectic eigenvalue problem, the butterfly form, the SR algorithm, and the Lanczos method
• An implicitly restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem
• A Riemannian steepest descent approach over the inhomogeneous symplectic group: application to the averaging of linear optical systems
• Two adaptive scaled gradient projection methods for Stiefel manifold constrained optimization
• Global convergence of Riemannian line search methods with a Zhang-Hager-type condition
• Efficient quasi-geodesics on the Stiefel manifold
• A brief introduction to manifold optimization
• On the steplength selection in gradient methods for unconstrained optimization
• Equivalence between modified symplectic Gram-Schmidt and Householder SR algorithms
• Implicit steepest descent algorithm for optimization with orthogonality constraints
• The parameterized 𝑆𝑅 algorithm for symplectic (butterfly) matrices
• The university of Florida sparse matrix collection
• The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
• Two Novel Gradient Methods with Optimal Step Sizes
• Symplectic Model Reduction of Hamiltonian Systems
• A Symplectic Lanczos-Type Algorithm to Compute the Eigenvalues of Positive Definite Hamiltonian Matrices
• The Riemannian Barzilai–Borwein method with nonmonotone line search and the matrix geometric mean computation
• A non-monotone linear search algorithm with mixed direction on Stiefel manifold
• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
• Riemannian Optimization on the Symplectic Stiefel Manifold
• Computing Symplectic Eigenpairs of Symmetric Positive-Definite Matrices via Trace Minimization and Riemannian Optimization
• Linear constraint problem of Hermitian unitary symplectic matrices

This page was built for publication: A collection of efficient retractions for the symplectic Stiefel manifold