Numerical optimization of eigenvalues of Hermitian matrix functions
From MaRDI portal
(Redirected from Publication:2923367)
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 -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.
Recommendations
- scientific article; zbMATH DE number 4096706
- A Support Function Based Algorithm for Optimization with Eigenvalue Constraints
- On minimizing the largest eigenvalue of a symmetric matrix
- Large-Scale Optimization of Eigenvalues
- A quadratically convergent local algorithm on minimizing sums of the largest eigenvalues of a symmetric matrix
Cited in
(30)- A subspace framework for \(\mathcal{H}_\infty \)-norm minimization
- Model order reduction for delay systems by iterative interpolation
- Large-Scale Optimization of Eigenvalues
- Generating eigenvalue bounds using optimization
- Krylov subspace methods for discrete-time algebraic Riccati equations
- Robust stability optimization for linear delay systems in a probabilistic framework
- Subspace acceleration for the Crawford number and related eigenvalue optimization problems
- Subspace acceleration for large-scale parameter-dependent Hermitian eigenproblems
- Variational characterization and Rayleigh quotient iteration of 2D eigenvalue problem with applications
- Spectrally constrained optimization
- Derivatives of symplectic eigenvalues and a Lidskii type theorem
- Generalized derivatives of eigenvalues of a symmetric matrix
- Matrix polynomials with specified eigenvalues
- Large-scale and global maximization of the distance to instability
- A Support Function Based Algorithm for Optimization with Eigenvalue Constraints
- Minimization of the pseudospectral abscissa of a quadratic matrix polynomial
- Approximate residual-minimizing shift parameters for the low-rank ADI iteration
- Large-scale minimization of the pseudospectral abscissa
- Nonsmooth optimization method for \(H_\infty\) output feedback control
- Large-scale computation of \(\mathcal{L}_\infty\)-norms by a greedy subspace method
- Nonlinear eigenvector methods for convex minimization over the numerical range
- Model Order Reduction in Contour Integral Methods for Parametric PDEs
- Approximation of stability radii for large-scale dissipative Hamiltonian systems
- Inheritance properties of Krylov subspace methods for continuous-time algebraic Riccati equations
- A subspace method for large-scale eigenvalue optimization
- Detecting large definite Hermitian matrix pairs by -subspace algorithms
- An unconstrained global optimization framework for real symmetric eigenvalue problems
- A subspace framework for \(\mathcal{L}_{\infty}\) model reduction
- Black-box learning of multigrid parameters
- Differential equations for real-structured defectivity measures
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)
