Sign in
The linear convergence of the greedy randomized Kaczmarz method is deterministic.
Yansheng Su
Deren Han
Yun Zeng
Jiaxin Xie
Published in:
CoRR (2023)
Keyphrases
</>
experimental evaluation
dynamic programming
high precision
significant improvement
high accuracy
preprocessing
closed form
cost function
computational efficiency
detection method
support vector machine
soft constraints
clustering method
markov random field
similarity measure
pairwise
video sequences