A subspace method for large-scale eigenvalue optimization
From MaRDI portal
Abstract: We consider the minimization or maximization of the th largest eigenvalue of an analytic and Hermitian matrix-valued function, and build on Mengi et al. (2014, SIAM J. Matrix Anal. Appl., 35, 699-724). This work addresses the setting when the matrix-valued function involved is very large. We describe subspace procedures that convert the original problem into a small-scale one by means of orthogonal projections and restrictions to certain subspaces, and that gradually expand these subspaces based on the optimal solutions of small-scale problems. Global convergence and superlinear rate-of-convergence results with respect to the dimensions of the subspaces are presented in the infinite dimensional setting, where the matrix-valued function is replaced by a compact operator depending on parameters. In practice, it suffices to solve eigenvalue optimization problems involving matrices with sizes on the scale of tens, instead of the original problem involving matrices with sizes on the scale of thousands.
Recommendations
- Large-Scale Optimization of Eigenvalues
- Subspace acceleration for the Crawford number and related eigenvalue optimization problems
- Numerical optimization of eigenvalues of Hermitian matrix functions
- A subspace accelerated truncated Newton algorithm for solving the extreme eigenvalue of a large-scale sparse symmetric matrix
- Minimization of a Large-Scale Quadratic FunctionSubject to a Spherical Constraint
Cites work
- A fast algorithm to compute the \(H_{\infty}\)-norm of a transfer function matrix
- A Newton-based method for the calculation of the distance to instability
- A regularity result for the singular values of a transfer matrix and a quadratically convergent algorithm for computing its \(L_{\infty}\)-norm
- A Spectral Bundle Method for Semidefinite Programming
- An Algorithm for Computing the Distance to Instability
- An algorithm for computing the numerical radius
- An inexact spectral bundle method for convex quadratic semidefinite programming
- Fields of values and iterative methods
- Geometric computation of the numerical radius of a matrix
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- scientific article; zbMATH DE number 1614156 (Why is no real title available?)
- scientific article; zbMATH DE number 3920686 (Why is no real title available?)
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 193012 (Why is no real title available?)
- scientific article; zbMATH DE number 194139 (Why is no real title available?)
- scientific article; zbMATH DE number 1049353 (Why is no real title available?)
- scientific article; zbMATH DE number 3288876 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- scientific article; zbMATH DE number 967335 (Why is no real title available?)
- Linear operators and their spectra
- Matrix Analysis
- Numerical methods for large eigenvalue problems
- Numerical optimization of eigenvalues of Hermitian matrix functions
- Numerical optimization. Theoretical and practice aspects
- On eigenvalues of matrices dependent on a parameter
- On minimizing the largest eigenvalue of a symmetric matrix
- On Minimizing the Maximum Eigenvalue of a Symmetric Matrix
- On the numerical radius of matrices and its application to iterative solution methods
- On the Optimal Design of Columns Against Buckling
- Perturbation theory for linear operators.
- Semidefinite Programming
- Subspace acceleration for the Crawford number and related eigenvalue optimization problems
- Subspace methods for computing the pseudospectral abscissa and the stability radius
- The Cutting-Plane Method for Solving Convex Programs
Cited in
(29)- Maximizing the smallest eigenvalue of a symmetric matrix: a submodular optimization approach
- A refined subspace iteration algorithm for large sparse eigenproblems
- Polynomial (chaos) approximation of maximum eigenvalue functions. Efficiency and limitations
- Generalized derivatives of eigenvalues of a symmetric matrix
- On the Kahan-Parlett-Jiang theorem -- a globally optimal backward perturbation error for two-sided invariant subspaces
- Inheritance properties of Krylov subspace methods for continuous-time algebraic Riccati equations
- Optimal expansion of subspaces for eigenvector approximations
- Subspace method for the estimation of large-scale structured real stability radius
- An adaptive quasi-Newton algorithm for eigensubspace estimation.
- Subspace acceleration for large-scale parameter-dependent Hermitian eigenproblems
- Low-rank matrix iteration using polynomial-filtered subspace extraction
- Eigensolver Methods for Progressive Multidimensional Scaling of Large Data
- Subspace acceleration for the Crawford number and related eigenvalue optimization problems
- Large-scale computation of \(\mathcal{L}_\infty\)-norms by a greedy subspace method
- Large-scale and global maximization of the distance to instability
- Theoretical and computable optimal subspace expansions for matrix eigenvalue problems
- Nonlinear eigenvector methods for convex minimization over the numerical range
- An Algebraic Substructuring Method for Large-Scale Eigenvalue Calculation
- A subspace framework for \(\mathcal{H}_\infty \)-norm minimization
- Model Order Reduction in Contour Integral Methods for Parametric PDEs
- Variational characterization and Rayleigh quotient iteration of 2D eigenvalue problem with applications
- Spectrally constrained optimization
- Large-scale minimization of the pseudospectral abscissa
- Theory and numerics of subspace approximation of eigenvalue problems
- Detecting large definite Hermitian matrix pairs by -subspace algorithms
- Subspace methods for nonlinear optimization
- Minimal compact operators, subdifferential of the maximum eigenvalue and semi-definite programming
- An indefinite LOBPCG type of algorithm for detecting a definite Hermitian matrix pair
- Extremal Steklov-Neumann eigenvalues
This page was built for publication: A subspace method for large-scale eigenvalue optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3130422)
