On global convergence of admissibly randomized coordinate descent method

DOI10.1016/J.AML.2025.109765MaRDI QIDQ6896934zbMATH OpenFDO

Authors Zhong-Zhi Bai, Yanqi Chen

Publication date 20 November 2025

Published in Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.AML.2025.109765

zbMATH Keywords

admissibly randomized coordinate descent methodeigenpairglobal convergencesymmetric matrix

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Iterative numerical methods for linear systems (65F10) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Computational methods for sparse matrices (65F50) Numerical solution of nonlinear eigenvalue and eigenvector problems (65H17)

Cites work

• A modified partially randomized extended Kaczmarz iteration method
• A new greedy Kaczmarz algorithm for the solution of very large linear systems
• Admissibly randomized coordinate descent methods for computing extreme eigenpairs of symmetric matrices.
• Extended Kaczmarz algorithm based on Tikhonov regularization
• scientific article; zbMATH DE number 1049353 (Why is no real title available?)
• scientific article; zbMATH DE number 6159604 (Why is no real title available?)
• Matrix Analysis and Computations
• Numerical methods for large eigenvalue problems
• On local quadratic convergence of inexact simplified Jacobi-Davidson method
• On local quadratic convergence of inexact simplified Jacobi-Davidson method for interior eigenpairs of Hermitian eigenproblems
• The method of coordinate overrelaxation for \((A-\lambda B)x = 0\)
• The power method and beyond

Cited in

(1)

• On global convergence of steepest coordinate descent method

This page was built for publication: On global convergence of admissibly randomized coordinate descent method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6896934)