On relaxed greedy randomized iterative methods for the solution of factorized linear systems
DOI10.11650/TJM/220305zbMATH Open1505.65161OpenAlexW4226139340MaRDI QIDQ2083243FDOQ2083243
Authors: Shi-Min Liu, Yong Liu 
Publication date: 10 October 2022
Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.11650/tjm/220305
Recommendations
- A randomised iterative method for solving factorised linear systems
- On the convergence of randomized and greedy relaxation schemes for solving nonsingular linear systems of equations
- 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
- A partially greedy randomized extended Gauss-Seidel method for solving large linear systems
- On relaxed greedy randomized augmented Kaczmarz methods for solving large sparse inconsistent linear systems
- On greedy randomized Kaczmarz method for solving large sparse linear systems
- Randomized iterative methods for linear systems
- On greedy randomized block Kaczmarz method for consistent linear systems
- On greedy randomized coordinate descent methods for solving large linear least-squares problems.
relaxation parameterfactorized linear systemsgreedy randomized Gauss-Seidelgreedy randomized Kaczmarz
Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Linear equations (linear algebraic aspects) (15A06) Iterative numerical methods for linear systems (65F10)
Cites Work
- Regularization tools version \(4.0\) for matlab \(7.3\)
- Matrix completion from noisy entries
- A randomized Kaczmarz algorithm with exponential convergence
- Title not available (Why is that?)
- Exact matrix completion via convex optimization
- Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
- Randomized methods for linear constraints: convergence rates and conditioning
- Extensions of block-projections methods with relaxation parameters to inconsistent and rank-deficient least-squares problems
- Strong underrelaxation in Kaczmarz's method for inconsistent systems
- Randomized extended Kaczmarz for solving least squares
- Convergence properties of the randomized extended Gauss-Seidel and Kaczmarz methods
- Least-squares solution of overdetermined inconsistent linear systems using kaczmarz's relaxation
- Randomized Kaczmarz solver for noisy linear systems
- On greedy randomized coordinate descent methods for solving large linear least‐squares problems
- On the acceleration of Kaczmarz's method for inconsistent linear systems
- On the Meany inequality with applications to convergence analysis of several row-action iteration methods
- On convergence rate of the randomized Kaczmarz method
- On greedy randomized Kaczmarz method for solving large sparse linear systems
- On the relation between the randomized extended Kaczmarz algorithm and coordinate descent
- On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systems
- Supplementary projections for the acceleration of Kaczmarz algorithm
- On partially randomized extended Kaczmarz method for solving large sparse overdetermined inconsistent linear systems
- Tight upper bounds for the convergence of the randomized extended Kaczmarz and Gauss–Seidel algorithms
- Iterative Methods for Solving Factorized Linear Systems
- Variant of greedy randomized Kaczmarz for ridge regression
Cited In (6)
- RCHOL: Randomized Cholesky Factorization for Solving SDD Linear Systems
- On the convergence of randomized and greedy relaxation schemes for solving nonsingular linear systems of equations
- A randomised iterative method for solving factorised linear systems
- On the relaxed greedy deterministic row and column iterative methods
- Variant of greedy randomized Kaczmarz for ridge regression
- Regularized randomized iterative algorithms for factorized linear systems
Uses Software
This page was built for publication: On relaxed greedy randomized iterative methods for the solution of factorized linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2083243)
