Pages that link to "Item:Q2192631"
From MaRDI portal
The following pages link to On relaxed greedy randomized coordinate descent methods for solving large linear least-squares problems (Q2192631):
Displaying 15 items.
- Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization (Q486721) (← links)
- A new randomized Gauss-Seidel method for solving linear least-squares problems (Q2021500) (← links)
- On maximum residual block and two-step Gauss-Seidel algorithms for linear least-squares problems (Q2041935) (← links)
- Randomized double and triple Kaczmarz for solving extended normal equations (Q2041936) (← links)
- On the convergence of a randomized block coordinate descent algorithm for a matrix least squares problem (Q2060942) (← links)
- Gauss-Seidel method with oblique direction (Q2063282) (← links)
- On relaxed greedy randomized iterative methods for the solution of factorized linear systems (Q2083243) (← links)
- A two-step randomized Gauss-Seidel method for solving large-scale linear least squares problems (Q2127524) (← links)
- Greedy randomized and maximal weighted residual Kaczmarz methods with oblique projection (Q2127557) (← links)
- On the relaxed greedy deterministic row and column iterative methods (Q2161834) (← links)
- On multi-step greedy randomized coordinate descent method for solving large linear least-squares problems (Q2686517) (← links)
- Adaptive Randomized Coordinate Descent for Sparse Systems: Lasso and Greedy Algorithms (Q4580720) (← links)
- On adaptive block coordinate descent methods for ridge regression (Q6060680) (← links)
- On greedy randomized block Gauss-Seidel method with averaging for sparse linear least-squares problems (Q6142558) (← links)
- Tensor randomized extended Kaczmarz methods for large inconsistent tensor linear equations with t-product (Q6582400) (← links)
