On Maximizing the Minimum Eigenvalue of a Linear Combination of Symmetric Matrices
From MaRDI portal
Recommendations
- An Interior-Point Method for Minimizing the Maximum Eigenvalue of a Linear Combination of Matrices
- Yuan's alternative theorem and the maximization of the minimum eigenvalue function
- On Minimizing the Maximum Eigenvalue of a Symmetric Matrix
- On minimizing the largest eigenvalue of a symmetric matrix
- A quadratically convergent local algorithm on minimizing sums of the largest eigenvalues of a symmetric matrix
Cited in
(13)- Solutions to a quadratic inverse eigenvalue problem
- A note on best constants in discrete inequalities
- Method of centers for minimizing generalized eigenvalues
- A quadratically convergent local algorithm on minimizing the largest eigenvalue of a symmetric matrix
- Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices
- Yuan's alternative theorem and the maximization of the minimum eigenvalue function
- On minimizing the largest eigenvalue of a symmetric matrix
- Maximizing the smallest eigenvalue of a symmetric matrix: a submodular optimization approach
- Dominant eigenvalue minimization with trace preserving diagonal perturbation: subset design problem
- Computing the greatest \(\mathbf{X}\)-eigenvector of a matrix in max-min algebra.
- On Minimizing the Maximum Eigenvalue of a Symmetric Matrix
- Calculating the minimal/maximal eigenvalue of symmetric parameterized matrices using projection
- Performance optimization for discrete network localization
This page was built for publication: On Maximizing the Minimum Eigenvalue of a Linear Combination of Symmetric Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4735287)