[00430] Nearest singular pencil via Riemannian optimization
Session Time & Room : 1E (Aug.21, 17:40-19:20) @G304
Type : Contributed Talk
Abstract : The problem of finding the nearest complex $($real$)$ singular pencil can be cast as a minimization problem over the manifold $U(n) \times U(n)$ $\left( O(n) \times O(n) \right)$ via the generalized Schur form. This novel perspective yields a competitive numerical method by pairing it with an algorithm capable of doing optimization on a Riemannian manifold.
