English

Orthogonal Invariance and Identifiability

Optimization and Control 2013-04-15 v2

Abstract

Orthogonally invariant functions of symmetric matrices often inherit properties from their diagonal restrictions: von Neumann's theorem on matrix norms is an early example. We discuss the example of "identifiability", a common property of nonsmooth functions associated with the existence of a smooth manifold of approximate critical points. Identifiability (or its synonym, "partial smoothness") is the key idea underlying active set methods in optimization. Polyhedral functions, in particular, are always partly smooth, and hence so are many standard examples from eigenvalue optimization.

Keywords

Cite

@article{arxiv.1304.1198,
  title  = {Orthogonal Invariance and Identifiability},
  author = {Aris Daniilidis and Dmitriy Drusvyatskiy and Adrian S. Lewis},
  journal= {arXiv preprint arXiv:1304.1198},
  year   = {2013}
}

Comments

21 pages, 2 figures

R2 v1 2026-06-21T23:53:33.545Z