Solving Minimal-Distance Problems over the Manifold of Real-Symplectic Matrices

DOI10.1137/100817115zbMath1234.65032OpenAlexW1963794468MaRDI QIDQ3112401

Simone Fiori

Publication date: 16 January 2012

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/19af9054a888b2c4784d3a98a76cd412517643f4

zbMATH Keywords

convergencenumerical examplespseudo-Riemannian geometrygeodesic-stepping methodgradient-based optimization on manifoldsgroup of real-symplectic matricesminimal-distance problem

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Geometric measure and integration theory, integral and normal currents in optimization (49Q15) Global Riemannian geometry, including pinching (53C20)

Related Items (12)

Optimal unit triangular factorization of symplectic matrices ⋮ Nonlinear damped oscillators on Riemannian manifolds: fundamentals ⋮ Symplectic eigenvalues of positive-semidefinite matrices and the trace minimization theorem ⋮ A Riemannian steepest descent approach over the inhomogeneous symplectic group: application to the averaging of linear optical systems ⋮ Unit Triangular Factorization of the Matrix Symplectic Group ⋮ Robustness analysis of a hybrid of recursive neural dynamics for online matrix inversion ⋮ Kolmogoroff-Nagumo mean over the affine symplectic group of matrices ⋮ Averaging on manifolds by embedding algorithm ⋮ Optimization on the real symplectic group ⋮ Riemannian Optimization on the Symplectic Stiefel Manifold ⋮ The extended Hamiltonian algorithm for the solution of the algebraic Riccati equation ⋮ Geometry of the symplectic Stiefel manifold endowed with the Euclidean metric

This page was built for publication: Solving Minimal-Distance Problems over the Manifold of Real-Symplectic Matrices