caa a22 4500 605496986 CHVBK 20210128100539.0 cr unu---uuuuu 210128e20151201xx s 000 0 eng 10.1007/s10543-014-0526-9 doi (NATIONALLICENCE)springer-10.1007/s10543-014-0526-9 Dumitrescu Bogdan Department of Automatic Control and Computers, University Politehnica of Bucharest, Spl. Independenţei 313, 060042, Bucharest, Romania aut On the relation between the randomized extended Kaczmarz algorithm and coordinate descent [Elektronische Daten] [Bogdan Dumitrescu] In this note we compare the randomized extended Kaczmarz (EK) algorithm and randomized coordinate descent (CD) for solving the full-rank overdetermined linear least-squares problem and prove that CD needs fewer operations for satisfying the same residual-related termination criteria. For the general least-squares problems, we show that first running CD to compute the residual and then standard Kaczmarz on the resulting consistent system is more efficient than EK. Springer Science+Business Media Dordrecht, 2014 Randomized algorithms nationallicence Least-squares nationallicence Kaczmarz method nationallicence Coordinate descent nationallicence BIT Numerical Mathematics Springer Netherlands 55/4(2015-12-01), 1005-1015 0006-3835 55:4<1005 2015 55 10543 https://doi.org/10.1007/s10543-014-0526-9 text/html Onlinezugriff via DOI BK010053 XK010053 XK010000 Metadata rights reserved Springer special CC-BY-NC licence nationallicence 1 research-article jats NATIONALLICENCE NATIONALLICENCE NL-springer NATIONALLICENCE 856 40 https://doi.org/10.1007/s10543-014-0526-9 text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Dumitrescu Bogdan Department of Automatic Control and Computers, University Politehnica of Bucharest, Spl. Independenţei 313, 060042, Bucharest, Romania aut NATIONALLICENCE 773 0- BIT Numerical Mathematics Springer Netherlands 55/4(2015-12-01), 1005-1015 0006-3835 55:4<1005 2015 55 10543