A Lanczos Method for Large-Scale Extreme Lorentz Eigenvalue Problems
From MaRDI portal
Large-scale problems in mathematical programming (90C06) Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Variational and other types of inequalities involving nonlinear operators (general) (47J20)
Recommendations
- scientific article; zbMATH DE number 1293808
- Lanczos algorithms for large scale symmetric and nonsymmetric matrix eigenvalue problems
- A filtered Lanczos procedure for extreme and interior eigenvalue problems
- Computation of eigenpairs and their derivatives of large-scale matrix based on Lanczos method
- A survey of Lanczos procedures for very large real 'symmetric' eigenvalue problems
- Proper use of Lanczos vectors for large eigenvalue problems
- scientific article; zbMATH DE number 3978275
- scientific article; zbMATH DE number 147692
- A MULTIGRID-LANCZOS ALGORITHM FOR THE NUMERICAL SOLUTIONS OF NONLINEAR EIGENVALUE PROBLEMS
- Thick-restart Lanczos method for large symmetric eigenvalue problems
Cites work
- scientific article; zbMATH DE number 3849762 (Why is no real title available?)
- scientific article; zbMATH DE number 6513624 (Why is no real title available?)
- scientific article; zbMATH DE number 3725604 (Why is no real title available?)
- scientific article; zbMATH DE number 46855 (Why is no real title available?)
- scientific article; zbMATH DE number 3633705 (Why is no real title available?)
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- scientific article; zbMATH DE number 1049353 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A DC programming approach for solving the symmetric eigenvalue complementarity problem
- A new matrix-free algorithm for the large-scale trust-region subproblem
- A new method for solving second-order cone eigenvalue complementarity problems
- A nonsmooth algorithm for cone-constrained eigenvalue problems
- A semidefinite framework for trust region subproblems with applications to large scale minimization
- A symmetric band Lanczos process based on coupled recurrences and some applications
- A trust-region approach to the regularization of large-scale discrete forms of ill-posed problems
- A variational approach to copositive matrices
- Algorithm 873
- An adaptive block Lanczos algorithm
- An indefinite variant of LOBPCG for definite matrix pencils
- Benchmarking optimization software with performance profiles.
- Computing a Trust Region Step
- Cone-constrained eigenvalue problems: Theory and algorithms
- Convergence of the block Lanczos method for eigenvalue clusters
- Critical angles between two convex cones. II: Special cases
- Efficient DC programming approaches for the asymmetric eigenvalue complementarity problem
- Eigenvalue analysis of equilibrium processes defined by linear complementarity conditions
- Implementation Aspects of Band Lanczos Algorithms for Computation of Eigenvalues of Large Sparse Symmetric Matrices
- Majorization for Changes in Angles Between Subspaces, Ritz Values, and Graph Laplacian Spectra
- Matrix algorithms. Vol. 2: Eigensystems
- Minimization of a Large-Scale Quadratic FunctionSubject to a Spherical Constraint
- Minimizing a quadratic over a sphere
- Newton’s Method with a Model Trust Region Modification
- Numerical methods for large eigenvalue problems
- On eigenvalues induced by a cone constraint.
- On the computation of all eigenvalues for the eigenvalue complementarity problem
- On the generalized Lanczos trust-region method
- On the quadratic eigenvalue complementarity problem over a general convex cone
- On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm
- Positive operators on the \(n\)-dimensional ice cream cone
- Quadratically constrained least squares and quadratic problems
- Sharpness in rates of convergence for the symmetric Lanczos method
- Solving inverse cone-constrained eigenvalue problems
- Solving the Trust-Region Subproblem using the Lanczos Method
- Some NP-complete problems in quadratic and nonlinear programming
- Templates for the Solution of Algebraic Eigenvalue Problems
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- The University of Florida sparse matrix collection
- The directional instability problem in systems with frictional contacts.
- The second-order cone eigenvalue complementarity problem
- The trust region subproblem and semidefinite programming*
- Trust Region Methods
- Variational inequality formulation of the asymmetric eigenvalue complementarity problem and its solution by means of gap functions
Cited in
(10)- An alternating direction method of multipliers for the eigenvalue complementarity problem
- Spectral classification of convex cones
- Improved dc programming approaches for solving the quadratic eigenvalue complementarity problem
- A Block Lanczos Method for Large-Scale Quadratic Minimization Problems with Orthogonality Constraints
- A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem
- An efficient numerical method for the symmetric positive definite second-order cone linear complementarity problem
- scientific article; zbMATH DE number 3898117 (Why is no real title available?)
- Proper use of Lanczos vectors for large eigenvalue problems
- Cone-constrained eigenvalue problems: structure of cone spectra
- A Nested Lanczos Method for the Trust-Region Subproblem
This page was built for publication: A Lanczos Method for Large-Scale Extreme Lorentz Eigenvalue Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5373928)
