The Normal Procrustes Problem: A Riemannian Optimization Approach

DOI10.48550/arXiv.2608.19513MaRDI QIDQ7285034zbMATH OpenarXivFDO

Authors Kyle Bierly

Publication date 20 August 2026

Published in arXiv

Tldr We propose an Riemannian manifold optimization approach to solve the Normal Procrustes Problem, which involves minimizing $\|AX-Y\|_F^2$ over normal matrices $A$, and its real counterpart; our method recovers novel algorithms for approximating solutions to both the Closest Normal Matrix Problems.

Full work available at URL https://doi.org/10.48550/arXiv.2608.19513

Mathematics Subject Classification ID

Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Orthogonal matrices (15B10) Numerical optimization and variational techniques (65K10) Nonconvex programming, global optimization (90C26)

arXiv classification

math.NAmath.OC

Cites work

• A combinatorial survey of identities for the double factorial
• A semi-analytical approach for the positive semidefinite Procrustes problem
• An Introduction to Optimization on Smooth Manifolds
• Bounds for iterates, inverses, spectral variation and fields of values of non-normal matrices
• Closest normal matrix finally found
• Computing the closest real normal matrix and normal completion
• Finding the closest normal structured matrix
• Procrustes Problems
• The linear targeting problem
• The normal \(\Delta\) H-matrices with connection to some Jacobi-like methods
• The structured condition number of a differentiable map between matrix manifolds, with applications
• The zero set of a real analytic function
• Trust-region methods on Riemannian manifolds

This page was built for publication: The Normal Procrustes Problem: A Riemannian Optimization Approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7285034)