Computing eigenelements of real symmetric matrices via optimization
From MaRDI portal
Recommendations
- Unconstrained optimization models for computing several extreme eigenpairs of real symmetric matrices
- Partial solution of large symmetric generalized eigenvalue problems by nonlinear optimization of a modified Rayleigh quotient
- An unconstrained global optimization framework for real symmetric eigenvalue problems
- A truncated-CG style method for symmetric generalized eigenvalue problems
- Large-Scale Optimization of Eigenvalues
Cited in
(14)- The symmetric eigenvalue complementarity problem
- Large-Scale Optimization of Eigenvalues
- Computing Matrix Eigenvalues and Polynomial Zeros Where the Output is Real
- A limited memory BFGS algorithm for non-convex minimization with applications in matrix largest eigenvalue problem
- On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm
- Reduction of the RPA eigenvalue problem and a generalized Cholesky decomposition for real-symmetric matrices
- Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization
- Continuous methods for symmetric generalized eigenvalue problems
- A DC programming approach for solving the symmetric eigenvalue complementarity problem
- Unconstrained optimization models for computing several extreme eigenpairs of real symmetric matrices
- Computation of eigenvalues of a real matrix
- Barzilai-Borwein-like methods for the extreme eigenvalue problem
- scientific article; zbMATH DE number 1817681 (Why is no real title available?)
- An unconstrained global optimization framework for real symmetric eigenvalue problems
This page was built for publication: Computing eigenelements of real symmetric matrices via optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1771219)
