Weighted Trace-Penalty Minimization for Full Configuration Interaction
From MaRDI portal
Publication:6189167
DOI10.1137/23m1547676arXiv2301.07270MaRDI QIDQ6189167
Unnamed Author, Weiguo Gao, Yingzhou Li
Publication date: 8 February 2024
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2301.07270
eigensolverfull configuration interactioncoordinate descent methodweighted trace-penalty minimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A projected preconditioned conjugate gradient algorithm for computing many extreme eigenpairs of a Hermitian matrix
- Block Krylov-Schur method for large symmetric eigenvalue problems
- The trace minimization method for the symmetric generalized eigenvalue problem
- Orbital minimization method with \(\ell^{1}\) regularization
- Triangularized orthogonalization-free method for solving extreme eigenvalue problems
- A brief introduction to manifold optimization
- Trace-penalty minimization for large-scale eigenspace computation
- First-order methods almost always avoid strict saddle points
- Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method
- Approximating Spectral Densities of Large Matrices
- A Chebyshev–Davidson Algorithm for Large Symmetric Eigenproblems
- Block Locally Optimal Preconditioned Eigenvalue Xolvers (BLOPEX) in Hypre and PETSc
- Two-Point Step Size Gradient Methods
- A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints
- The Full Configuration Interaction Quantum Monte Carlo Method through the Lens of Inexact Power Iteration
- CoordinateWise Descent Methods for Leading Eigenvalue Problem
- An Efficient Gauss--Newton Algorithm for Symmetric Low-Rank Product Matrix Approximations
- A Simplification of the Hartree-Fock Method
- Global convergence of triangularized orthogonalization-free method
