Counting Real Critical Points of the Distance to Orthogonally Invariant Matrix Sets
From MaRDI portal
Publication:3195439
DOI10.1137/15M1007835zbMath1322.15004arXiv1502.02074OpenAlexW2963416195MaRDI QIDQ3195439
Rekha R. Thomas, Hon-Leung Lee, Dmitriy Drusvyatskiy
Publication date: 19 October 2015
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1502.02074
Nonconvex programming, global optimization (90C26) Real algebraic sets (14P05) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items (5)
The Euclidean distance degree of orthogonally invariant matrix varieties ⋮ The Chow form of the essential variety in computer vision ⋮ The data singular and the data isotropic loci for affine cones ⋮ Critical points via monodromy and local methods ⋮ Variational analysis of spectral functions simplified
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Euclidean distance degrees of real algebraic groups
- Elementary structure of real algebraic varieties
- All convex invariant functions of hermitian matrices
- On the differentiability of O(n) invariant functions of symmetric matrices
- The mathematics of eigenvalue optimization
- Nonsmooth analysis of eigenvalues
- Differentiability properties of isotropic functions
- Nonsmooth analysis of singular values. I: Theory
- Condition
- Introduction to Smooth Manifolds
- Orthogonal Invariance and Identifiability
- Derivatives of Spectral Functions
- Exact Solutions in Structured Low-Rank Approximation
- Approximating functions on stratified sets
- Variational analysis of non-Lipschitz spectral functions
- The Euclidean distance degree of an algebraic variety
This page was built for publication: Counting Real Critical Points of the Distance to Orthogonally Invariant Matrix Sets
