On multi-step greedy randomized coordinate descent method for solving large linear least-squares problems
DOI10.1007/s40314-022-02163-zOpenAlexW4313682921MaRDI QIDQ2686517
Publication date: 27 February 2023
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-022-02163-z
convergence propertylinear least-squares problemsgreedy randomized coordinate descentmulti-step greedy randomized coordinate descent
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05) Convex programming (90C25) Iterative numerical methods for linear systems (65F10) Linear equations (linear algebraic aspects) (15A06)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On the complexity analysis of randomized block-coordinate descent methods
- A randomized Kaczmarz algorithm with exponential convergence
- Numerical aspects of Gram-Schmidt orthogonalization of vectors
- On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systems
- On relaxed greedy randomized coordinate descent methods for solving large linear least-squares problems
- Random block coordinate descent methods for linearly constrained optimization over networks
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
- Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
- Efficiency of the Accelerated Coordinate Descent Method on Structured Optimization Problems
- Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
- Convergence Properties of the Randomized Extended Gauss--Seidel and Kaczmarz Methods
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- On Greedy Randomized Kaczmarz Method for Solving Large Sparse Linear Systems
- A New Theoretical Estimate for the Convergence Rate of the Maximal Weighted Residual Kaczmarz Algorithm
- On greedy randomized coordinate descent methods for solving large linear least‐squares problems
This page was built for publication: On multi-step greedy randomized coordinate descent method for solving large linear least-squares problems
