The Euclidean Distance Degree of Orthogonally Invariant Matrix Varieties
classification
🧮 math.OC
keywords
degreedistanceeuclideaninvariantmatrixorthogonallycalculationscircumstances
read the original abstract
We show that the Euclidean distance degree of a real orthogonally invariant matrix variety equals the Euclidean distance degree of its restriction to diagonal matrices. We illustrate how this result can greatly simplify calculations in concrete circumstances.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.