Fetching the paper…
Reading the bibliography…
In this paper we present a convergence rate analysis of inexact variants of several randomized iterative methods.
Angenäherte auflösung von systemen linearer gleichungen
S. Kaczmarz · 1937
Earlier work this paper cites.
Inexact Newton methods
R.S. Dembo, S.C. Eisenstat, and T. Steihaug · 1982
Earlier work this paper cites.
Least-squares solution of overdetermined inconsistent linear systems using Kaczmarz’s relaxation
C. Popa · 1995
Earlier work this paper cites.
Numerical optimization
S. Wright and J. Nocedal · 1999
Earlier work this paper cites.
A unified framework for some inexact proximal point algorithms
M.V. Solodov and B.F. Svaiter · 2001
Earlier work this paper cites.
Applied iterative methods
C.L. Byrne · 2008
Earlier work this paper cites.
Randomized methods for linear constraints: convergence rates and conditioning
D. Leventhal and A.S. Lewis · 2010
Earlier work this paper cites.
Randomized Kaczmarz solver for noisy linear systems
D. Needell · 2010
Earlier work this paper cites.
Libsvm: a library for support vector machines
Chih-Chung Chang and Chih-Jen Lin · 2011
Earlier work this paper cites.
Acceleration of randomized Kaczmarz method via the Johnson–Lindenstrauss lemma
Y.C. Eldar and D. Needell · 2011
Earlier work this paper cites.
Projected Newton-type methods in machine learning
M. Schmidt, D. Kim, and S. Sra · 2011
Earlier work this paper cites.
Convergence rates of inexact proximal-gradient methods for convex optimization
M. Schmidt, N.L. Roux, and F.R. Bach · 2011
Earlier work this paper cites.
Hybrid deterministic-stochastic methods for data fitting
M.P. Friedlander and M. Schmidt · 2012
Earlier work this paper cites.
Matrix computations
G.H. Golub and C.F Van Loan · 2012
Earlier work this paper cites.
Efficiency of coordinate descent methods on huge-scale optimization problems
Y. Nesterov · 2012
Earlier work this paper cites.
Inexact and accelerated proximal point algorithms
S. Salzo and S. Villa · 2012
Earlier work this paper cites.
On the convergence of inexact block coordinate descent methods for constrained optimization
A. Cassioli, D. Di Lorenzo, and M. Sciandrone · 2013
Earlier work this paper cites.
Efficient accelerated coordinate descent methods and faster algorithms for solving linear systems
Y.T. Lee and A. Sidford · 2013
Earlier work this paper cites.
Randomized extended Kaczmarz for solving least squares
A. Zouzias and N.M. Freris · 2013
Earlier work this paper cites.
First-order methods of smooth convex optimization with inexact oracle
O. Devolder, F. Glineur, and Y. Nesterov · 2014
Earlier work this paper cites.
Rate analysis of inexact dual first-order methods application to dual decomposition
I. Necoara and V. Nedelcu · 2014
Cited alongside, same era.
Paved with good intentions: analysis of a randomized block Kaczmarz method
D. Needell and J.A. Tropp · 2014
Cited alongside, same era.
Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
P. Richtárik and M. Takáč · 2014
Cited alongside, same era.
Termination criteria for inexact fixed-point schemes
P. Birken · 2015
Cited alongside, same era.
Accelerated, parallel, and proximal coordinate descent
O. Fercoq and P. Richtárik · 2015
Cited alongside, same era.
Randomized iterative methods for linear systems
R.M. Gower and P. Richtárik · 2015
Cited alongside, same era.
Sub-sampled Newton methods with non-uniform sampling
P. Xu, . Yang, J, F. Roosta-Khorasani, C. Ré, and M.W. Mahoney · 2016
Later among the works it cites.
An investigation of Newton-sketch and subsampled Newton methods
A.S. Berahas, R. Bollapragada, and J. Nocedal · 2017
Later among the works it cites.
Global convergence of arbitrary-block gradient methods for generalized Polyak-Lojasiewicz functions
D. Csiba and P. Richtárik · 2017
Later among the works it cites.
P. Dvurechensky, A. Gasnikov, and A. Tiurin · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Stochastic dual ascent for solving linear systems
R.M. Gower and P. Richtárik · 2015
Cited alongside, same era.
Convergence properties of the randomized extended Gauss-Seidel and Kaczmarz methods
A. Ma, D. Needell, and A. Ramdas · 2015
Cited alongside, same era.
Randomized block Kaczmarz method with projection for solving least squares
D. Needell, R. Zhao, and A. Zouzias · 2015
Cited alongside, same era.
Quartz: Randomized dual coordinate ascent with arbitrary sampling
Z. Qu, P. Richtárik, and T. Zhang · 2015
Cited alongside, same era.
Even faster accelerated coordinate descent using non-uniform sampling
Z. Allen-Zhu, Z. Qu, P. Richtárik, and Y. Yuan · 2016
Cited alongside, same era.
Exact and inexact subsampled Newton methods for optimization
R. Bollapragada, R. Byrd, and J. Nocedal · 2016
Cited alongside, same era.
F. Hanzely, J. Konečný, N. Loizou, P. Richtárik, and D. Grishchenko · 2017
Later among the works it cites.
B. Hu, P. Seiler, and L. Lessard · 2017
Later among the works it cites.
Linearly convergent stochastic heavy ball method for minimizing generalization error
N. Loizou and P. Richtárik · 2017
Later among the works it cites.
N. Loizou and P. Richtárik · 2017
Later among the works it cites.
Convergence rates for Kaczmarz-type algorithms
C. Popa · 2017
Later among the works it cites.
Stochastic reformulations of linear systems: algorithms and convergence theory
P. Richtárik and M. Takáč · 2017
Later among the works it cites.
Non-asymptotic convergence analysis of inexact gradient methods for machine learning without strong convexity
Anthony Man-Cho So and Z. Zhou · 2017
Later among the works it cites.
Breaking locality accelerates block Gauss-Seidel
S. Tu, S. Venkataraman, A.C. Wilson, A. Gittens, M.I. Jordan, and B. Recht · 2017
Later among the works it cites.
Newton-type methods for non-convex optimization under inexact hessian information
P. Xu, F. Roosta-Khorasani, and M.W. Mahoney · 2017
Later among the works it cites.
Stochastic primal-dual hybrid gradient algorithm with arbitrary sampling and imaging applications
A. Chambolle, M.J. Ehrhardt, P. Richtárik, and C.B. Schönlieb · 2018
Later among the works it cites.
A flexible coordinate descent method
K. Fountoulakis and R. Tappenden · 2018
Later among the works it cites.
A privacy preserving randomized gossip algorithm via controlled noise insertion
F. Hanzely, J. Konečnỳ, N. Loizou, P. Richtárik, and D. Grishchenko · 2018
Later among the works it cites.
Provably accelerated randomized gossip algorithms
N. Loizou, M. Rabbat, and P. Richtárik · 2018
Later among the works it cites.
Accelerated gossip via stochastic heavy ball method
N. Loizou and P. Richtárik · 2018
Later among the works it cites.
Inexact non-convex Newton-type methods
Zhewei Yao, Peng Xu, Farbod Roosta-Khorasani, and Michael W Mahoney · 2018
Later among the works it cites.