Fetching the paper…
Reading the bibliography…
Probabilistic ideas and tools have recently begun to permeate into several fields where they had traditionally not played a major role, including fields such as numerical linear algebra and optimization.
“Abstract for “On the reciprocal of the general algebraic matrix””
E.˜H. Moore · 1920
Earlier work this paper cites.
“Randomized gossip algorithms for solving Laplacian systems”
Anastasios Zouzias and Nikolaos˜M Freris · 1925
Earlier work this paper cites.
“Iterative Berechung der reziproken Matrix”
G\"unther Schulz · 1933
Earlier work this paper cites.
“Angenäherte Auflösung von Systemen linearer Gleichungen”
M˜S Kaczmarz · 1937
Earlier work this paper cites.
“A New Method for Obtaining the Inverse Matrix”
M.˜D. Bingham · 1941
Earlier work this paper cites.
“Inverting modified matrices”, 1950
Max˜A Woodbury · 1950
Earlier work this paper cites.
“A stochastic approximation method”
H. Robbins and S. Monro · 1951
Earlier work this paper cites.
“Methods of Conjugate Gradients for Solving Linear Systems”
M.˜R. Hestenes and E. Stiefel · 1952
Earlier work this paper cites.
“A generalized inverse for matrices”
R. Penrose · 1955
Earlier work this paper cites.
“Variable metric method for minimization”, 1959
W.˜C Davidon · 1959
Earlier work this paper cites.
“A Note on Pseudoinverses”
C.˜A. Desoer and B.˜H. Whalen · 1963
Earlier work this paper cites.
“A Rapidly Convergent Descent Method for Minimization”
By˜R Fletcher and M˜J˜D Powell · 1963
Earlier work this paper cites.
“A class of methods for solving nonlinear simultaneous equations”
C.˜G. Broyden · 1965
Earlier work this paper cites.
“Variance algorithms for minimization”
W˜C Davidon · 1968
Earlier work this paper cites.
“Variations on Variable-Metric Methods”
By˜J Greenstadt · 1969
Earlier work this paper cites.
“A constrained minimization method with quadratic convergence”
B˜A Murtagh and R˜W˜H Sargent · 1969
Earlier work this paper cites.
“A Family of Variable-Metric Methods Derived by Variational Means”
Donald Goldfarb · 1970
Earlier work this paper cites.
“Conditioning of Quasi-Newton Methods for Function Minimization”
D˜F Shanno · 1971
Earlier work this paper cites.
“Modification Methods for Inverting Matrices and Solving Systems of Linear Algebraic Equations”
D. Goldfarb · 1972
Earlier work this paper cites.
“Solution of Sparse Indefinite Systems of Linear Equations”
C.˜C. Paige and M.˜A. Saunders · 1975
Earlier work this paper cites.
“Updating Quasi-Newton Matrices with Limited Storage”
Jorge Nocedal · 1980
Earlier work this paper cites.
“Row-Action Methods for Huge and Sparse Systems and Their Applications”
Yair Censor · 1981
Earlier work this paper cites.
“Inexact Newton Methods”
Ron˜S. Dembo, Stanley˜C. Eisenstat and Trond Steihaug · 1982
Earlier work this paper cites.
“Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient Method”
V. Faber and T. Manteuffel · 1984
Earlier work this paper cites.
“GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems”
Youcef Saad and Martin˜H. Schultz · 1986
Earlier work this paper cites.
“The Probability that a Numerical Analysis Problem is Difficult”
James˜W. Demmel · 1988
Earlier work this paper cites.
“Parallel and Distributed Computation: Numerical Methods”
Dimitri˜P. Bertsekas and John˜N. Tsitsiklis · 1989
Earlier work this paper cites.
“s-step iterative methods for symmetric linear systems”
A.T. Chronopoulos and C.W. Gear · 1989
Earlier work this paper cites.
“Some aspects of parallel and distributed iterative algorithms - A survey, .”
Dimitri˜P. Bertsekas and John˜N. Tsitsiklis · 1991
Earlier work this paper cites.
“An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications”
Victor Pan and Robert Schreiber · 1991
Earlier work this paper cites.
“Probability with Martingales”, Cambridge mathematical textbooks
D. Williams · 1991
Earlier work this paper cites.
“On the Distribution of a Scaled Condition Number”
Alan Edelman · 1992
Earlier work this paper cites.
“Factorized Sparse Approximate Inverse Preconditionings I. Theory”
L.˜Yu. Kolotilina and A.˜Yu. Yeremin · 1993
Earlier work this paper cites.
“Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods”
R. Barrett, M.W. Berry, T.F. Chan, J. Demmel, J. Donato, J. Dongarra, V. Eijkhout, R. Pozo, C. Romine and H. Vorst · 1994
Earlier work this paper cites.
“Choosing the Forcing Terms in an Inexact Newton Method”
Stanley˜C. Eisenstat and Homer˜F. Walker · 1994
Earlier work this paper cites.
“Iterative Methods for Linear and Nonlinear Equations”, Frontiers in Applied Mathematics
C.˜T. Kelley · 1995
Earlier work this paper cites.
“Matrix Market : A Web Resource for Test Matrix Collections”
Ronald˜F Boisvert, Roldan Pozo, Karin Remington, Richard˜F Barrett and Jack˜J Dongarra · 1997
Earlier work this paper cites.
“An Inexact Interior Point Method”
Stefania Bellavia · 1998
Earlier work this paper cites.
“Approximate Inverse Preconditioners Via Sparse-Sparse Iterations”
Edmond Chow and Yousef Saad · 1998
Earlier work this paper cites.
“Sparse Approximate-Inverse Preconditioners Using Norm-Minimization Techniques”
Nicholas I.˜M. Gould and Jennifer˜A. Scott · 1998
Earlier work this paper cites.
“Comparative Study of Sparse Approximate Inverse Preconditioners”
Michele Benzi and Miroslav Tůma · 1999
Earlier work this paper cites.
“Finding frequent items in data streams”
Moses Charikar, Kevin Chen and Martin Farach-Colton · 2002
Earlier work this paper cites.
“Iterative Methods for Sparse Linear Systems”
Y. Saad · 2003
Earlier work this paper cites.
“An improved data stream summary: the count-min sketch and its applications”
Graham Cormode and S. Muthukrishnan · 2005
Earlier work this paper cites.
“Gaussian Markov Random Fields: Theory and Applications”
Havard Rue and Leonhard Held · 2005
Earlier work this paper cites.
“Label Propagation and Quadratic Criterion”
Yoshua Bengio, Olivier Delalleau and Nicolas Le Roux · 2006
Earlier work this paper cites.
“Convex analysis and nonlinear optimization”
Jonathan˜M Borwein and Adrian˜S Lewis · 2006
Earlier work this paper cites.
“Randomized gossip algorithms”
S. Boyd, A. Ghosh, B. Prabhakar and D. Shah · 2006
Cited alongside, same era.
“Frobenius norm minimization and probing for preconditioning”
Thomas Huckle and Alexander Kallischko · 2007
Cited alongside, same era.
“Positive Definite Matrices”, Princeton Series in Applied Mathematics
Rajendra Bhatia · 2008
Cited alongside, same era.
“A dual coordinate descent method for large-scale linear SVM”
Cho˜Jui Hsieh, Kai˜Wei Chang, Chih˜Jen Lin, S˜Sathiya Keerthi and Sellamanickam Sundararajan · 2008
Cited alongside, same era.
“A Family of Iterative Methods for Computing the Approximate Inverse of a Square Matrix and Inner Inverse of a Non-Square Matrix”
Weiguo Li and Zhi Li · 2009
Cited alongside, same era.
“Convergence Speed in Distributed Consensus and Averaging”
Alex Olshevsky and John˜N Tsitsiklis · 2009
“SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectives”
Aaron Defazio, Francis Bach and Simon Lacoste-Julien · 2014
Later among the works it cites.
“Fast distributed coordinate descent for minimizing non-strongly convex losses”
Olivier Fercoq, Zheng Qu, Peter Richt\’arik and Martin Tak\’ac · 2014
Later among the works it cites.
“Preconditioned Recycling Krylov subspace methods for self-adjoint problems”
Andr\’e Gaul and Nico Schl\"omer · 2014
Later among the works it cites.
“Higher-order reverse automatic differentiation with emphasis on the third-order”
R.˜M. Gower and A.˜L. Gower · 2014
Later among the works it cites.
“Action constrained quasi-Newton methods”
Robert˜M. Gower and Jacek Gondzio · 2014
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
“A Randomized Kaczmarz Algorithm with Exponential Convergence”
Thomas Strohmer and Roman Vershynin · 2009
Cited alongside, same era.
“Blendenpik: Supercharging LAPACK’s Least-Squares Solver”
Haim Avron, Petar Maymounkov and Sivan Toledo · 2010
Cited alongside, same era.
“Randomized Methods for Linear Constraints: Convergence Rates and Conditioning”
D. Leventhal and A.˜S. Lewis · 2010
Cited alongside, same era.
“Randomized Kaczmarz solver for noisy linear systems”
D. Needell · 2010
Cited alongside, same era.
“A Newton-CG Augmented Lagrangian Method for Semidefinite Programming”
Xin˜Yuan Zhao, Defeng Sun and Kim˜Chuan Toh · 2010
Cited alongside, same era.
“Parallel Coordinate Descent for
Joseph˜K Bradley, Aapo Kyrola, Danny Bickson and Carlos Guestrin · 2011
Cited alongside, same era.
Later among the works it cites.
“Computing the Sparsity Pattern of Hessians Using Automatic Differentiation”
Robert˜Mansel Gower and Margarida˜Pinheiro Mello · 2014
Later among the works it cites.
“CVX: Matlab Software for Disciplined Convex Programming, version 2.1”, 2014
Michael Grant and Stephen Boyd · 2014
Later among the works it cites.
“S2GD: Semi-stochastic gradient descent methods”
Jakub Konecn\’y and Peter Richt\’arik · 2014
Later among the works it cites.
“Krylov Subspace Methods : Principles and Analysis”
J\"org Liesen and Zdenek Strakos · 2014
Later among the works it cites.
“An accelerated proximal coordinate gradient method”
Qihang Lin, Zhaosong Lu and Lin Xiao · 2014
Later among the works it cites.
“An Asynchronous Parallel Randomized Kaczmarz Algorithm”
Ji Liu, Stephen˜J Wright and Sridhar Srikrishna · 2014
Later among the works it cites.
“A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints”
Ion Necoara and Andrei Patrascu · 2014
Later among the works it cites.
“Coordinate descent with arbitrary sampling I: algorithms and complexity”
Zheng Qu and Peter Richt\’arik · 2014
Later among the works it cites.
“Coordinate descent with arbitrary sampling II: expected separable overapproximation”
Zheng Qu and Peter Richt\’arik · 2014
Later among the works it cites.
“Rows vs Columns for Linear Systems of Equations - Randomized Kaczmarz or Coordinate Descent ?”
Aaditya Ramdas · 2014
Later among the works it cites.
“Iteration Complexity of Randomized Block-Coordinate Descent Methods for Minimizing a Composite Function”
Peter Richt\’arik and Martin Tak\’ac · 2014
Later among the works it cites.
“Computational methods for linear matrix equations”
Valeria Simoncini · 2014
Later among the works it cites.
“Optimization of Convex Functions with Random Pursuit”
S.˜U. Stich, C.˜L. M\"uller and B. G\"artner · 2014
Later among the works it cites.
“Convex Optimization with Random Pursuit”, 2014
Sebastian˜Urban Stich · 2014
Later among the works it cites.
“A Proximal Stochastic Gradient Method with Progressive Variance Reduction”
Lin Xiao and Tong Zhang · 2014
Later among the works it cites.
“Stochastic Dual Coordinate Ascent with Adaptive Probabilities”
Dominik Csiba, Zheng Qu and Peter Richt\’arik · 2015
Later among the works it cites.
“Stochastic Dual Ascent for Solving Linear Systems”
Robert˜M. Gower and Peter Richt\’arik · 2015
Later among the works it cites.
“Randomized Iterative Methods for Linear Systems”
Robert˜Mansel Gower and Peter Richt\’arik · 2015
Later among the works it cites.
“Probabilistic interpretation of linear solvers”
Philipp Hennig · 2015
Later among the works it cites.
“Convergence properties of the randomized extended Gauss-Seidel and Kaczmarz methods”
Anna Ma, Deanna Needell and Aaditya Ramdas · 2015
Later among the works it cites.
“Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm”
Deanna Needell, Nathan Srebro and Rachel Ward · 2015
Later among the works it cites.
“Randomized Block Kaczmarz Method with Projection for Solving Least Squares”
Deanna Needell, Ran Zhao and Anastasios Zouzias · 2015
Later among the works it cites.
“Convergence analysis for Kaczmarz-type methods in a Hilbert space framework”
Peter Oswald and Weiqi Zhou · 2015
Later among the works it cites.
“Randomized Sketches of Convex Programs With Sharp Guarantees”
M. Pilanci and M.J. Wainwright · 2015
Later among the works it cites.
“Newton Sketch : A Linear-time Optimization Algorithm with Linear-Quadratic Convergence”
Mert Pilanci and Martin˜J Wainwright · 2015
Later among the works it cites.
“Quartz: Randomized dual coordinate ascent with arbitrary sampling”
Zheng Qu, Peter Richt\’arik and Tong Zhang · 2015
Later among the works it cites.
“On optimal probabilities in stochastic coordinate descent methods”
Peter Richt\’arik and Martin Tak\’ac · 2015
Later among the works it cites.
“Parallel coordinate descent methods for big data optimization problems”
Peter Richt\’arik and Martin Tak\’ac · 2015
Later among the works it cites.
“A Flexible ADMM Algorithm for Big Data Applications”
Daniel˜P. Robinson and Rachael E.˜H. Tappenden · 2015
Later among the works it cites.
“Variable metric random pursuit”
S.˜U. Stich, C.˜L. M\"uller and B. G\"artner · 2015
Later among the works it cites.
“Coordinate descent methods”
Stephen˜J Wright · 2015
Later among the works it cites.
“Stochastic Primal-Dual Coordinate Method for Regularized Empirical Risk Minimization”
Yuchen Zhang and Lin Xiao · 2015
Later among the works it cites.
“Stochastic Optimization with Importance Sampling for Regularized Loss Minimization”
Peilin Zhao and Tong Zhang · 2015
Later among the works it cites.
“High-performance conjugate-gradient benchmark: A new metric for ranking high-performance computing systems.”
Jack Dongarra, Michael˜A. Heroux and Piotr Luszczek · 2016
Closest in time.
“Stochastic Block BFGS: Squeezing More Curvature out of Data”
Robert˜M. Gower, Donald Goldfarb and Peter Richt\’arik · 2016
Closest in time.
“Randomized Quasi-Newton Updates are Linearly Convergent Matrix Inversion Algorithms”
Robert˜Mansel Gower and Peter Richt\’arik · 2016
Closest in time.
“Mini-Batch Semi-Stochastic Gradient Descent in the Proximal Setting”
Jakub Konecn\’y, Jie Liu, Peter Richt\’arik and Martin Tak\’ac · 2016
Closest in time.
“An accelerated randomized Kaczmarz algorithm”
Ji Liu and Stephen˜J. Wright · 2016
Closest in time.
“Iterative Hessian sketch : Fast and Accurate Solution Approximation for Constrained Least-Squares”
Mert Pilanci and Martin˜J. Wainwright · 2016
Closest in time.
“SDNA: Stochastic Dual Newton Ascent for Empirical Risk Minimization”
Zheng Qu, Peter Richt\’arik, Martin Tak\’ac and Olivier Fercoq · 2016
Closest in time.
“Accelerated, parallel and proximal coordinate descent”
Olivier Fercoq and Peter Richt\’arik · 2023
Closest in time.