A Block Lanczos Method for Large-Scale Quadratic Minimization Problems with Orthogonality Constraints
From MaRDI portal
Publication:6154199
DOI10.1137/23m1568545arXiv2304.11886MaRDI QIDQ6154199
Publication date: 19 March 2024
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2304.11886
block Krylov subspaceblock LanczosQMPOquadratic minimization problems with orthogonality constraints
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical optimization and variational techniques (65K10) Quadratic programming (90C20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A feasible method for optimization with orthogonality constraints
- A framework of constraint preserving update schemes for optimization on Stiefel manifold
- Successive projection method for solving the unbalanced Procrustes problem
- A Procrustes problem on the Stiefel manifold
- Trust-region methods on Riemannian manifolds
- Matrix Algorithms
- Minimizing a Quadratic Over a Sphere
- Generalized power method for sparse principal component analysis
- Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem
- Numerical Methods for Large Eigenvalue Problems
- A Nested Lanczos Method for the Trust-Region Subproblem
- Computing a Trust Region Step
- Maximization of Matrix Trace Function of Product Stiefel Manifolds
- The Geometry of Algorithms with Orthogonality Constraints
- Procrustes Problems
- Trust Region Methods
- The Procrustes Problem for Orthogonal Stiefel Matrices
- A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints
- Solving the Trust-Region Subproblem using the Lanczos Method
- First-Order Methods for Nonconvex Quadratic Minimization
- Parallelizable Algorithms for Optimization Problems with Orthogonality Constraints
- Structured Quasi-Newton Methods for Optimization with Orthogonality Constraints
- Superlinear Convergence of Krylov Subspace Methods for Self-Adjoint Problems in Hilbert Space
- On the Generalized Lanczos Trust-Region Method
- A Lanczos Method for Large-Scale Extreme Lorentz Eigenvalue Problems
- Functions of Matrices
- A Krylov Subspace Method for Large-Scale Second-Order Cone Linear Complementarity Problem
- An Eigenvalue-Based Method for the Unbalanced Procrustes Problem
- The Convergence of the Generalized Lanczos Trust-Region Method for the Trust-Region Subproblem