The multi-step randomized coordinate descent methods with new probability criterion

DOI10.1007/S40314-025-03592-2MaRDI QIDQ6852924zbMATH OpenFDO

Authors Hailong Shen, Wenjun Yu

Publication date 25 February 2026

Published in Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S40314-025-03592-2

zbMATH Keywords

convergence propertylinear least squares problemsprobability distributionrandomized coordinate descent

Mathematics Subject Classification ID

Preconditioners for iterative methods (65F08) Iterative numerical methods for linear systems (65F10)

Cites work

• A coordinate descent margin based-twin support vector machine for classification
• A doubly stochastic block Gauss-Seidel algorithm for solving linear equations
• A linearly convergent doubly stochastic Gauss-Seidel algorithm for solving linear equations and a certain class of over-parameterized optimization problems
• A new randomized Gauss-Seidel method for solving linear least-squares problems
• A note on convergence rate of randomized Kaczmarz method
• A randomized coordinate descent method with volume sampling
• A randomized Kaczmarz algorithm with exponential convergence
• Convergence properties of the randomized extended Gauss-Seidel and Kaczmarz methods
• Edge-Preserving Image Denoising via Group Coordinate Descent on the GPU
• Efficiency of coordinate descent methods on huge-scale optimization problems
• Gauss-Seidel method with oblique direction
• scientific article; zbMATH DE number 852525 (Why is no real title available?)
• scientific article; zbMATH DE number 852536 (Why is no real title available?)
• Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods
• Numerical aspects of Gram-Schmidt orthogonalization of vectors
• On convergence rate of the randomized Gauss-Seidel method
• On greedy randomized block Gauss-Seidel method with averaging for sparse linear least-squares problems
• On greedy randomized coordinate descent methods for solving large linear least-squares problems.
• On greedy randomized Kaczmarz method for solving large sparse linear systems
• On multi-step greedy randomized coordinate descent method for solving large linear least-squares problems
• On relaxed greedy randomized coordinate descent methods for solving large linear least-squares problems
• On the complexity analysis of randomized block-coordinate descent methods
• On the convergence of a randomized block coordinate descent algorithm for a matrix least squares problem
• Randomized methods for linear constraints: convergence rates and conditioning

This page was built for publication: The multi-step randomized coordinate descent methods with new probability criterion

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