Global convergence of triangularized orthogonalization-free method
From MaRDI portal
Abstract: This paper proves the global convergence of a triangularized orthogonalization-free method (TriOFM). TriOFM, in general, applies a triangularization idea to the gradient of an objective function and removes the rotation invariance in minimizers. More precisely, in this paper, the TriOFM works as an eigensolver for sizeable sparse matrices and obtains eigenvectors without any orthogonalization step. Due to the triangularization, the iteration is a discrete-time flow in a non-conservative vector field. The global convergence relies on the stable manifold theorem, whereas the convergence to stationary points is proved in detail in this paper. We provide two proofs inspired by the noisy power method and the noisy optimization method, respectively.
Recommendations
- Triangularized orthogonalization-free method for solving extreme eigenvalue problems
- A Global Convergence Analysis for Computing a Symmetric Low-Rank Orthogonal Approximation
- Convergence of the tridiagonal QR algorithm
- Global convergence of general derivative-free trust-region algorithms to first- and second-order critical points
- A global convergence proof for cyclic Jacobi methods with block rotations
Cited in
(3)- Triangularized orthogonalization-free method for solving extreme eigenvalue problems
- Weighted Trace-Penalty Minimization for Full Configuration Interaction
- On the convergence of orthogonalization-free conjugate gradient method for extreme eigenvalues of Hermitian matrices: a Riemannian optimization interpretation
This page was built for publication: Global convergence of triangularized orthogonalization-free method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6171041)
