Numerical optimization of eigenvalues of Hermitian matrix functions

From MaRDI portal
Publication:2923367

DOI10.1137/130933472zbMATH Open1307.65043arXiv1109.2080OpenAlexW2037064199MaRDI QIDQ2923367FDOQ2923367

E. Alper Yildirim, Emre Mengi, Mustafa Kiliç

Publication date: 15 October 2014

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Abstract: This work concerns the global minimization of a prescribed eigenvalue or a weighted sum of prescribed eigenvalues of a Hermitian matrix-valued function depending on its parameters analytically in a box. We describe how the analytical properties of eigenvalue functions can be put into use to derive piece-wise quadratic functions that underestimate the eigenvalue functions. These piece-wise quadratic under-estimators lead us to a global minimization algorithm, originally due to Breiman and Cutler. We prove the global convergence of the algorithm, and show that it can be effectively used for the minimization of extreme eigenvalues, e.g., the largest eigenvalue or the sum of the largest specified number of eigenvalues. This is particularly facilitated by the analytical formulas for the first derivatives of eigenvalues, as well as analytical lower bounds on the second derivatives that can be deduced for extreme eigenvalue functions. The applications that we have in mind also include the mHinfty-norm of a linear dynamical system, numerical radius, distance to uncontrollability and various other non-convex eigenvalue optimization problems, for which, generically, the eigenvalue function involved is simple at all points.


Full work available at URL: https://arxiv.org/abs/1109.2080




Recommendations





Cited In (25)

Uses Software





This page was built for publication: Numerical optimization of eigenvalues of Hermitian matrix functions

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