Tight upper bounds for the convergence of the randomized extended Kaczmarz and Gauss-Seidel algorithms.

Published in: Numer. Linear Algebra Appl. (2019)

Keyphrases

upper bound
worst case
lower bound
computational efficiency
upper and lower bounds
randomized algorithms
convergence rate
computational complexity
multi objective
optimization problems
convergence analysis
gauss seidel